Method and apparatus for encoding/decoding image using quantization parameter, and recording medium storing bitstream

ABSTRACT

There is provided an image encoding/decoding method and apparatus. The image decoding method comprises decoding size information of a quantization group from a bitstream, acquiring a delta quantization parameter of a current block on the basis of the size information of the quantization group, and deriving a quantization parameter for the current block on the basis of the delta quantization parameter.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation application of U.S. patentapplication Ser. No. 17/256,150, filed on Dec. 24, 2020, which was theNational Stage of International Application No. PCT/KR2019/007675 filedon Jun. 25, 2019, which claims priority to Korean Patent Applications:KR10-2018-0072999 filed on Jun. 25, 2018, KR10-2018-0133494 filed onNov. 2, 2018, KR10-2018-0161324 filed on Dec. 13, 2018, andKR10-2019-0026208 filed on Mar. 7, 2019 with the Korean IntellectualProperty Office, which are incorporated herein by reference in theirentirety.

TECHNICAL FIELD

The present invention relates to an image encoding/decoding method andapparatus and a recording medium in which a bitstream is stored. Moreparticularly, the present invention relates to an imageencoding/decoding method and apparatus using quantization parameters anda recording medium in which a bitstream is stored.

BACKGROUND ART

Recently, the demand for high resolution and quality images such as highdefinition (HD) or ultra-high definition (UHD) images has increased invarious applications. As the resolution and quality of images areimproved, the amount of data correspondingly increases. This is one ofthe causes of increase in transmission cost and storage cost whentransmitting image data through existing transmission media such aswired or wireless broadband channels or when storing image data. Inorder to solve such problems with high resolution and quality imagedata, a high efficiency image encoding/decoding technique is required.

There are various video compression techniques such as an interprediction technique of predicting the values of pixels within a currentpicture from the values of pixels within a preceding picture or asubsequent picture, an intra prediction technique of predicting thevalues of pixels within a region of a current picture from the values ofpixels within another region of the current picture, a transform andquantization technique of compressing the energy of a residual signal,and an entropy coding technique of allocating frequently occurring pixelvalues with shorter codes and less occurring pixel values with longercodes.

In conventional technology for video encoding/decoding methods andapparatuses using quantization parameters, only quadtree blocks areconsidered. Therefore, the conventional technology has difficultydealing with encoding or decoding delta quantization parameters forblocks having various tree structures.

DISCLOSURE Technical Problem

An objective of the present invention is to provide an imageencoding/decoding method and apparatus using quantization parameters.

Another objective of the present invention is to provide an imageencoding/decoding method and apparatus adaptively determining a suitablesize of a block for which a delta quantization parameter is to besignaled, for according to a block structure, according to sizeinformation of a quantization group encoded/decoded on a high-level, toimprove signaling and coding efficiency of quantization parameters.

A further objective of the present invention is to provide an imageencoding/decoding method and apparatus that determine a quantizationparameter for a current block on the basis of a quantization parameterof a neighboring quantization group, to reduce the number of bitsrequired for encoding/decoding of a delta quantization parameter.

A further objective of the present invention is to provide a recordingmedium in which a bitstream generated by the image encoding/decodingmethod or apparatus is stored.

Technical Solution

According to the present invention, there is provided an image decodingmethod comprising: decoding size information of a quantization groupfrom a bitstream; acquiring a delta quantization parameter of a currentblock on the basis of the size information of the quantization group;and deriving a quantization parameter for the current block on the basisof the delta quantization parameter.

According to one embodiment, the size information of the quantizationgroup includes one or more pieces of information selected from amongdepth information, length information, area information, ratioinformation, shape information, and subdivision information of thequantization group.

According to one embodiment, the quantization group includes a squareshape or a non-square shape.

According to one embodiment, the non-square shape is any shape based ona binary tree, a ternary tree, or both.

According to one embodiment, the acquiring of the delta quantizationparameter of the current block comprises: determining the size of thequantization group on the basis of the size information of thequantization group; and acquiring the delta quantization parameter ofthe current block on the basis of the size of the quantization group.

According to one embodiment, the delta quantization parameter of thecurrent block is acquired on the basis of a relationship between a depthof the current block and the depth information of the quantizationgroup.

According to one embodiment, the delta quantization parameter of thecurrent block is acquired on the basis of a size relationship between anarea of the current block and the area information of the quantizationgroup.

According to one embodiment, the delta quantization parameter of thecurrent block is acquired on the basis of a relationship between asubdivision value of the current block and the subdivision informationof the quantization group.

According to one embodiment, the subdivision value of the current blockis a value equal to two plus an original subdivision value beforepartitioning of the current block when the current block is a blockgenerated through quadtree partitioning.

According to one embodiment, the subdivision value of the current blockis a value equal to one plus an original subdivision value beforepartitioning of the current block when the current block is a blockgenerated through binary tree partitioning.

Also, according to the present invention, there is provided an imageencoding method comprising: determining a size of a quantization group;determining a quantization parameter for a current block on the basis ofthe size of the quantization group; deriving a delta quantizationparameter of the current block on the basis of the quantizationparameter; and encoding size information of the quantization group.

According to one embodiment, the size information of the quantizationgroup includes one or more pieces of information selected from amongdepth information, length information, area information, ratioinformation, shape information, and subdivision information of thequantization group.

According to one embodiment, the quantization group includes a squareshape or a non-square shape.

According to one embodiment, the non-square shape is any shape based ona binary tree, a ternary tree, or both.

According to one embodiment, the delta quantization parameter of thecurrent block is acquired on the basis of a relationship between a depthof the current block and the depth information of the quantizationgroup.

According to one embodiment, the delta quantization parameter of thecurrent block is acquired on the basis of a size relationship between anarea of the current block and the area information of the quantizationgroup.

According to one embodiment, the delta quantization parameter of thecurrent block is derived on the basis of a relationship between asubdivision value of the current block and the subdivision informationof the quantization group.

According to one embodiment, the subdivision value of the current blockis a value equal to two plus an original subdivision value of thecurrent block before partitioning when the current block is a blockgenerated through quadtree partitioning.

According to one embodiment, the subdivision value of the current blockis a value equal to one plus an original subdivision value beforepartitioning of the current block when the current block is a blockgenerated through binary tree partitioning.

Also, according to the present invention, there is provided acomputer-readable non-transitory recording medium in which image dataused in an image decoding method is stored, wherein the image datacontains size information of a quantization group, and in the imagedecoding method, the size information of the quantization group is usedto acquire a delta quantization parameter of a current block and is usedto derive a quantization parameter of the current block on the basis ofthe delta quantization parameter.

Advantageous Effects

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus using quantization parameters.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus adaptively determining a suitablesize of a block for which a delta quantization parameter is to besignaled, according to size information of a quantization groupencoded/decoded on a high-level.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus determining a quantizationparameter for a current block using a quantization parameter of aneighboring quantization group.

According to the present invention, it is possible to provide arecording medium storing a bitstream generated by the encoding/decodingmethod or apparatus according to the present invention.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating the configuration of oneembodiment of an encoding apparatus to which the present invention isapplied;

FIG. 2 is a block diagram illustrating the configuration of oneembodiment of a decoding apparatus to which the present invention isapplied;

FIG. 3 is a schematic view illustrating a picture partition structureused when encoding decoding an image;

FIG. 4 is a diagram illustrating one embodiment of an intra predictionprocess;

FIG. 5 is a diagram illustrating one embodiment of an inter predictionprocess;

FIG. 6 is a diagram used to describe a transform and quantizationprocess.

FIG. 7 is a diagram used to describe an available reference sample forintra prediction;

FIG. 8 is a diagram illustrating an image encoding/decoding processperformed on a CTU basis, according to one embodiment of the presentinvention;

FIG. 9A is a flowchart illustrating an image decoding method accordingto one embodiment of the present invention;

FIG. 9B is a flowchart illustrating an image encoding method accordingto one embodiment of the present invention;

FIG. 10 is a diagram illustrating a process of deriving predictedquantization parameters of a current quantization group, according toone embodiment of the present invention;

FIG. 11 is a diagram illustrating a process of deriving predictedquantization parameters of a current quantization group, according toanother embodiment of the present invention;

FIG. 12 is a diagram illustrating a process of deriving predictedquantization parameters of a current quantization group, according to afurther embodiment of the present invention;

FIG. 13 is a diagram illustrating a process of deriving predictedquantization parameters of a current quantization group, according to afurther embodiment of the present invention;

FIG. 14 is a diagram illustrating sequences of encoding/decoding forcases where a CU according to one embodiment of the present inventionhas a square shape and a non-square shape;

FIG. 15 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 256×256 size and a diff_cu_qp_delta_depth is2;

FIG. 16 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 256×256 size and alog2_diff_cu_qp_delta_length is 1;

FIG. 17 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various sizes of quantizationgroups that can be set when a CTU has a 128×128 size and adiff_cu_qp_delta_depth is 2;

FIG. 18 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 128×128 size and alog2_diff_cu_qp_delta_length is 2;

FIG. 19 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and alog2_diff_cu_qp_delta_length is 3;

FIG. 20 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a diff_cu_qp_delta_area is 3;

FIG. 21 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a diff_cu_qp_delta_area is 4;

FIG. 22 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a cu_gp_delta_subdiv is 3;

FIG. 23 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a cu_qp_delta_subdiv is 4;

FIG. 24 is a diagram illustrating a method of determining a quantizationparameter, using length information of a quantization group according toone embodiment of the present invention;

FIG. 25 is a diagram illustrating a method of determining a quantizationparameter, using area information of a quantization group according toone embodiment of the present invention;

FIG. 26 is a diagram illustrating a method of determining a quantizationparameter, using length information of a quantization group according toanother embodiment of the present invention;

FIG. 27 is a diagram illustrating a method of determining a quantizationparameter, using area information of a quantization group according to afurther embodiment of the present invention;

FIG. 28 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toone embodiment of the present invention;

FIG. 29 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toanother embodiment of the present invention;

FIG. 30 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toa further embodiment of the present invention; and

FIGS. 31 and 32 are diagrams illustrating examples of syntax elementinformation required for entropy coding/decoding of delta quantizationparameters according to one embodiment of the present invention.

BEST MODE

A variety of modifications may be made to the present invention andthere are various embodiments of the present invention, examples ofwhich will now be provided with reference to drawings and described indetail. However, the present invention is not limited thereto, althoughthe exemplary embodiments can be construed as including allmodifications, equivalents, or substitutes in a technical concept and atechnical scope of the present invention. The similar reference numeralsrefer to the same or similar functions in various aspects. In thedrawings, the shapes and dimensions of elements may be exaggerated forclarity. In the following detailed description of the present invention,references are made to the accompanying drawings that show, by way ofillustration, specific embodiments in which the invention may bepracticed. These embodiments are described in sufficient detail toenable those skilled in the art to implement the present disclosure. Itshould be understood that various embodiments of the present disclosure,although different, are not necessarily mutually exclusive. For example,specific features, structures, and characteristics described herein, inconnection with one embodiment, may be implemented within otherembodiments without departing from the spirit and scope of the presentdisclosure. In addition, it should be understood that the location orarrangement of individual elements within each disclosed embodiment maybe modified without departing from the spirit and scope of the presentdisclosure. The following detailed description is, therefore, not to betaken in a limiting sense, and the scope of the present disclosure isdefined only by the appended claims, appropriately interpreted, alongwith the full range of equivalents to what the claims claim.

Terms used in the specification, ‘first’, ‘second’, etc. can be used todescribe various components, but the components are not to be construedas being limited to the terms. The terms are only used to differentiateone component from other components. For example, the ‘first’ componentmay be named the ‘second’ component without departing from the scope ofthe present invention, and the ‘second’ component may also be similarlynamed the ‘first’ component. The term ‘and/or’ includes a combination ofa plurality of items or any one of a plurality of terms.

It will be understood that when an element is simply referred to asbeing ‘connected to’ or ‘coupled to’ another element without being‘directly connected to’ or ‘directly coupled to’ another element in thepresent description, it may be ‘directly connected to’ or ‘directlycoupled to’ another element or be connected to or coupled to anotherelement, having the other element intervening therebetween. In contrast,it should be understood that when an element is referred to as being“directly coupled” or “directly connected” to another element, there areno intervening elements present.

Furthermore, constitutional parts shown in the embodiments of thepresent invention are independently shown so as to representcharacteristic functions different from each other. Thus, it does notmean that each constitutional part is constituted in a constitutionalunit of separated hardware or software. In other words, eachconstitutional part includes each of enumerated constitutional parts forconvenience. Thus, at least two constitutional parts of eachconstitutional part may be combined to form one constitutional part orone constitutional part may be divided into a plurality ofconstitutional parts to perform each function. The embodiment where eachconstitutional part is combined and the embodiment where oneconstitutional part is divided are also included in the scope of thepresent invention, if not departing from the essence of the presentinvention.

The terms used in the present specification are merely used to describeparticular embodiments, and are not intended to limit the presentinvention. An expression used in the singular encompasses the expressionof the plural, unless it has a clearly different meaning in the context.In the present specification, it is to be understood that terms such as“including”, “having”, etc. are intended to indicate the existence ofthe features, numbers, steps, actions, elements, parts, or combinationsthereof disclosed in the specification, and are not intended to precludethe possibility that one or more other features, numbers, steps,actions, elements, parts, or combinations thereof may exist or may beadded. In other words, when a specific element is referred to as being“included”, elements other than the corresponding element are notexcluded, but additional elements may be included in embodiments of thepresent invention or the scope of the present invention.

In addition, some of constituents may not be indispensable constituentsperforming essential functions of the present invention but be selectiveconstituents improving only performance thereof. The present inventionmay be implemented by including only the indispensable constitutionalparts for implementing the essence of the present invention except theconstituents used in improving performance. The structure including onlythe indispensable constituents except the selective constituents used inimproving only performance is also included in the scope of the presentinvention.

Hereinafter, embodiments of the present invention will be described indetail with reference to the accompanying drawings. In describingexemplary embodiments of the present invention, well-known functions orconstructions will not be described in detail since they mayunnecessarily obscure the understanding of the present invention. Thesame constituent elements in the drawings are denoted by the samereference numerals, and a repeated description of the same elements willbe omitted.

Hereinafter, an image may mean a picture configuring a video, or maymean the video itself. For example, “encoding or decoding or both of animage” may mean “encoding or decoding or both of a moving picture”, andmay mean “encoding or decoding or both of one image among images of amoving picture.”

Hereinafter, terms “moving picture” and “video” may be used as the samemeaning and be replaced with each other.

Hereinafter, a target image may be an encoding target image which is atarget of encoding and/or a decoding target image which is a target ofdecoding. Also, a target image may be an input image inputted to anencoding apparatus, and an input image inputted to a decoding apparatus.Here, a target image may have the same meaning with the current image.

Hereinafter, terms “image”, “picture, “frame” and “screen” may be usedas the same meaning and be replaced with each other.

Hereinafter, a target block may be an encoding target block which is atarget of encoding and/or a decoding target block which is a target ofdecoding. Also, a target block may be the current block which is atarget of current encoding and/or decoding. For example, terms “targetblock” and “current block” may be used as the same meaning and bereplaced with each other.

Hereinafter, terms “block” and “unit” may be used as the same meaningand be replaced with each other. Or a “block” may represent a specificunit.

Hereinafter, terms “region” and “segment” may be replaced with eachother.

Hereinafter, a specific signal may be a signal representing a specificblock. For example, an original signal may be a signal representing atarget block. A prediction signal may be a signal representing aprediction block. A residual signal may be a signal representing aresidual block.

In embodiments, each of specific information, data, flag, index, elementand attribute, etc. may have a value. A value of information, data,flag, index, element and attribute equal to “0” may represent a logicalfalse or the first predefined value. In other words, a value “0”, afalse, a logical false and the first predefined value may be replacedwith each other. A value of information, data, flag, index, element andattribute equal to “1” may represent a logical true or the secondpredefined value. In other words, a value “1”, a true, a logical trueand the second predefined value may be replaced with each other.

When a variable i or j is used for representing a column, a row or anindex, a value of i may be an integer equal to or greater than 0, orequal to or greater than 1. That is, the column, the row, the index,etc. may be counted from 0 or may be counted from 1.

Description of Terms

Encoder: means an apparatus performing encoding. That is, means anencoding apparatus.

Decoder: means an apparatus performing decoding. That is, means andecoding apparatus.

Block: is an M×N array of a sample. Herein, M and N may mean positiveintegers, and the block may mean a sample array of a two-dimensionalform. The block may refer to a unit. A current block my mean an encodingtarget block that becomes a target when encoding, or a decoding targetblock that becomes a target when decoding. In addition, the currentblock may be at least one of an encode block, a prediction block, aresidual block, and a transform block.

Sample: is a basic unit constituting a block. It may be expressed as avalue from 0 to 2Bd−1 according to a bit depth (Bd). In the presentinvention, the sample may be used as a meaning of a pixel. That is, asample, a pel, a pixel may have the same meaning with each other.

Unit: may refer to an encoding and decoding unit. When encoding anddecoding an image, the unit may be a region generated by partitioning asingle image. In addition, the unit may mean a subdivided unit when asingle image is partitioned into subdivided units during encoding ordecoding. That is, an image may be partitioned into a plurality ofunits. When encoding and decoding an image, a predetermined process foreach unit may be performed. A single unit may be partitioned intosub-units that have sizes smaller than the size of the unit. Dependingon functions, the unit may mean a block, a macroblock, a coding treeunit, a code tree block, a coding unit, a coding block), a predictionunit, a prediction block, a residual unit), a residual block, atransform unit, a transform block, etc. In addition, in order todistinguish a unit from a block, the unit may include a luma componentblock, a chroma component block associated with the luma componentblock, and a syntax element of each color component block. The unit mayhave various sizes and forms, and particularly, the form of the unit maybe a two-dimensional geometrical figure such as a square shape, arectangular shape, a trapezoid shape, a triangular shape, a pentagonalshape, etc. In addition, unit information may include at least one of aunit type indicating the coding unit, the prediction unit, the transformunit, etc., and a unit size, a unit depth, a sequence of encoding anddecoding of a unit, etc.

Coding Tree Unit: is configured with a single coding tree block of aluma component Y, and two coding tree blocks related to chromacomponents Cb and Cr. In addition, it may mean that including the blocksand a syntax element of each block. Each coding tree unit may bepartitioned by using at least one of a quad-tree partitioning method, abinary-tree partitioning method and ternary-tree partitioning method toconfigure a lower unit such as coding unit, prediction unit, transformunit, etc. It may be used as a term for designating a sample block thatbecomes a process unit when encoding/decoding an image as an inputimage. Here, the quad-tree may mean a quaternary-tree.

When the size of the coding block is within a predetermined range, thedivision is possible using only quad-tree partitioning. Here, thepredetermined range may be defined as at least one of a maximum size anda minimum size of a coding block in which the division is possible usingonly quad-tree partitioning. Information indicating a maximum/minimumsize of a coding block in which quad-tree partitioning is allowed may besignaled through a bitstream, and the information may be signaled in atleast one unit of a sequence, a picture parameter, a tile group, or aslice (segment). Alternatively, the maximum/minimum size of the codingblock may be a fixed size predetermined in the coder/decoder. Forexample, when the size of the coding block corresponds to 256×256 to64×64, the division is possible only using quad-tree partitioning.Alternatively, when the size of the coding block is larger than the sizeof the maximum conversion block, the division is possible only usingquad-tree partitioning. Herein, the block to be divided may be at leastone of a coding block and a transform block. In this case, informationindicating the division of the coded block (for example, split_flag) maybe a flag indicating whether or not to perform the quad-treepartitioning. When the size of the coding block falls within apredetermined range, the division is possible only using binary tree orternary tree partitioning. In this case, the above description of thequad-tree partitioning may be applied to binary tree partitioning orternary tree partitioning in the same manner.

Coding Tree Block: may be used as a term for designating any one of a Ycoding tree block, Cb coding tree block, and Cr coding tree block.

Neighbor Block: may mean a block adjacent to a current block. The blockadjacent to the current block may mean a block that comes into contactwith a boundary of the current block, or a block positioned within apredetermined distance from the current block. The neighbor block maymean a block adjacent to a vertex of the current block. Herein, theblock adjacent to the vertex of the current block may mean a blockvertically adjacent to a neighbor block that is horizontally adjacent tothe current block, or a block horizontally adjacent to a neighbor blockthat is vertically adjacent to the current block.

Reconstructed Neighbor block: may mean a neighbor block adjacent to acurrent block and which has been already spatially/temporally encoded ordecoded. Herein, the reconstructed neighbor block may mean areconstructed neighbor unit. A reconstructed spatial neighbor block maybe a block within a current picture and which has been alreadyreconstructed through encoding or decoding or both. A reconstructedtemporal neighbor block is a block at a corresponding position as thecurrent block of the current picture within a reference image, or aneighbor block thereof.

Unit Depth: may mean a partitioned degree of a unit. In a treestructure, the highest node (Root Node) may correspond to the first unitwhich is not partitioned. Also, the highest node may have the leastdepth value. In this case, the highest node may have a depth of level 0.A node having a depth of level 1 may represent a unit generated bypartitioning once the first unit. A node having a depth of level 2 mayrepresent a unit generated by partitioning twice the first unit. A nodehaving a depth of level n may represent a unit generated by partitioningn-times the first unit. A Leaf Node may be the lowest node and a nodewhich cannot be partitioned further. A depth of a Leaf Node may be themaximum level. For example, a predefined value of the maximum level maybe 3. A depth of a root node may be the lowest and a depth of a leafnode may be the deepest. In addition, when a unit is expressed as a treestructure, a level in which a unit is present may mean a unit depth.

Bitstream: may mean a bitstream including encoding image information.

Parameter Set: corresponds to header information among a configurationwithin a bitstream. At least one of a video parameter set, a sequenceparameter set, a picture parameter set, and an adaptation parameter setmay be included in a parameter set. In addition, a parameter set mayinclude a slice header, a tile group header, and tile headerinformation. The term “tile group” means a group of tiles and has thesame meaning as a slice.

Parsing: may mean determination of a value of a syntax element byperforming entropy decoding, or may mean the entropy decoding itself.

Symbol: may mean at least one of a syntax element, a coding parameter,and a transform coefficient value of an encoding/decoding target unit.In addition, the symbol may mean an entropy encoding target or anentropy decoding result.

Prediction Mode: may be information indicating a mode encoded/decodedwith intra prediction or a mode encoded/decoded with inter prediction.

Prediction Unit: may mean a basic unit when performing prediction suchas inter-prediction, intra-prediction, inter-compensation,intra-compensation, and motion compensation. A single prediction unitmay be partitioned into a plurality of partitions having a smaller size,or may be partitioned into a plurality of lower prediction units. Aplurality of partitions may be a basic unit in performing prediction orcompensation. A partition which is generated by dividing a predictionunit may also be a prediction unit.

Prediction Unit Partition: may mean a form obtained by partitioning aprediction unit.

Reference picture list may refer to a list including one or morereference pictures used for inter prediction or motion compensation.There are several types of usable reference picture lists, including LC(List combined), L0 (List 0), L1 (List 1), L2 (List 2), L3 (List 3).

Inter prediction indicator may refer to a direction of inter prediction(unidirectional prediction, bidirectional prediction, etc.) of a currentblock. Alternatively, it may refer to the number of reference picturesused to generate a prediction block of a current block. Alternatively,it may refer to the number of prediction blocks used at the time ofperforming inter prediction or motion compensation on a current block.

Prediction list utilization flag indicates whether a prediction block isgenerated using at least one reference picture in a specific referencepicture list. An inter prediction indicator can be derived using aprediction list utilization flag, and conversely, a prediction listutilization flag can be derived using an inter prediction indicator. Forexample, when the prediction list utilization flag has a first value ofzero (0), it means that a reference picture in a reference picture listis not used to generate a prediction block. On the other hand, when theprediction list utilization flag has a second value of one (1), it meansthat a reference picture list is used to generate a prediction block.

Reference picture index may refer to an index indicating a specificreference picture in a reference picture list.

Reference picture may mean a reference picture which is referred to by aspecific block for the purposes of inter prediction or motioncompensation of the specific block. Alternatively, the reference picturemay be a picture including a reference block referred to by a currentblock for inter prediction or motion compensation. Hereinafter, theterms “reference picture” and “reference image” have the same meaningand can be interchangeably.

Motion vector may be a two-dimensional vector used for inter predictionor motion compensation. The motion vector may mean an offset between anencoding/decoding target block and a reference block. For example, (mvX,mvY) may represent a motion vector. Here, mvX may represent a horizontalcomponent and mvY may represent a vertical component.

Search range may be a two-dimensional region which is searched toretrieve a motion vector during inter prediction. For example, the sizeof the search range may be M×N. Here, M and N are both integers.

Motion vector candidate may refer to a prediction candidate block or amotion vector of the prediction candidate block when predicting a motionvector. In addition, a motion vector candidate may be included in amotion vector candidate list.

Motion vector candidate list may mean a list composed of one or moremotion vector candidates.

Motion vector candidate index may mean an indicator indicating a motionvector candidate in a motion vector candidate list. Alternatively, itmay be an index of a motion vector predictor.

Motion information may mean information including at least one of theitems including a motion vector, a reference picture index, an interprediction indicator, a prediction list utilization flag, referencepicture list information, a reference picture, a motion vectorcandidate, a motion vector candidate index, a merge candidate, and amerge index.

Merge candidate list may mean a list composed of one or more mergecandidates.

Merge candidate may mean a spatial merge candidate, a temporal mergecandidate, a combined merge candidate, a combined bi-predictive mergecandidate, or a zero merge candidate. The merge candidate may includemotion information such as an inter prediction indicator, a referencepicture index for each list, a motion vector, a prediction listutilization flag, and an inter prediction indicator.

Merge index may mean an indicator indicating a merge candidate in amerge candidate list. Alternatively, the merge index may indicate ablock from which a merge candidate has been derived, among reconstructedblocks spatially/temporally adjacent to a current block. Alternatively,the merge index may indicate at least one piece of motion information ofa merge candidate.

Transform Unit: may mean a basic unit when performing encoding/decodingsuch as transform, inverse-transform, quantization, dequantization,transform coefficient encoding/decoding of a residual signal. A singletransform unit may be partitioned into a plurality of lower-leveltransform units having a smaller size. Here,transformation/inverse-transformation may comprise at least one amongthe first transformation/the first inverse-transformation and the secondtransformation/the second inverse-transformation.

Scaling: may mean a process of multiplying a quantized level by afactor. A transform coefficient may be generated by scaling a quantizedlevel. The scaling also may be referred to as dequantization.

Quantization Parameter: may mean a value used when generating aquantized level using a transform coefficient during quantization. Thequantization parameter also may mean a value used when generating atransform coefficient by scaling a quantized level duringdequantization. The quantization parameter may be a value mapped on aquantization step size.

Delta Quantization Parameter: may mean a difference value between apredicted quantization parameter and a quantization parameter of anencoding/decoding target unit.

Scan: may mean a method of sequencing coefficients within a unit, ablock or a matrix. For example, changing a two-dimensional matrix ofcoefficients into a one-dimensional matrix may be referred to asscanning, and changing a one-dimensional matrix of coefficients into atwo-dimensional matrix may be referred to as scanning or inversescanning.

Transform Coefficient: may mean a coefficient value generated aftertransform is performed in an encoder. It may mean a coefficient valuegenerated after at least one of entropy decoding and dequantization isperformed in a decoder. A quantized level obtained by quantizing atransform coefficient or a residual signal, or a quantized transformcoefficient level also may fall within the meaning of the transformcoefficient.

Quantized Level: may mean a value generated by quantizing a transformcoefficient or a residual signal in an encoder. Alternatively, thequantized level may mean a value that is a dequantization target toundergo dequantization in a decoder. Similarly, a quantized transformcoefficient level that is a result of transform and quantization alsomay fall within the meaning of the quantized level.

Non-zero Transform Coefficient: may mean a transform coefficient havinga value other than zero, or a transform coefficient level or a quantizedlevel having a value other than zero.

Quantization Matrix: may mean a matrix used in a quantization process ora dequantization process performed to improve subjective or objectiveimage quality. The quantization matrix also may be referred to as ascaling list.

Quantization Matrix Coefficient: may mean each element within aquantization matrix. The quantization matrix coefficient also may bereferred to as a matrix coefficient.

Default Matrix: may mean a predetermined quantization matrixpreliminarily defined in an encoder or a decoder.

Non-default Matrix: may mean a quantization matrix that is notpreliminarily defined in an encoder or a decoder but is signaled by auser.

Statistic Value: a statistic value for at least one among a variable, anencoding parameter, a constant value, etc. which have a computablespecific value may be one or more among an average value, a sum value, aweighted average value, a weighted sum value, the minimum value, themaximum value, the most frequent value, a median value, an interpolatedvalue of the corresponding specific values.

FIG. 1 is a block diagram showing a configuration of an encodingapparatus according to an embodiment to which the present invention isapplied.

An encoding apparatus 100 may be an encoder, a video encoding apparatus,or an image encoding apparatus. A video may include at least one image.The encoding apparatus 100 may sequentially encode at least one image.

Referring to FIG. 1, the encoding apparatus 100 may include a motionprediction unit 111, a motion compensation unit 112, an intra-predictionunit 120, a switch 115, a subtractor 125, a transform unit 130, aquantization unit 140, an entropy encoding unit 150, a dequantizationunit 160, an inverse-transform unit 170, an adder 175, a filter unit180, and a reference picture buffer 190.

The encoding apparatus 100 may perform encoding of an input image byusing an intra mode or an inter mode or both. In addition, encodingapparatus 100 may generate a bitstream including encoded informationthrough encoding the input image, and output the generated bitstream.The generated bitstream may be stored in a computer readable recordingmedium, or may be streamed through a wired/wireless transmission medium.When an intra mode is used as a prediction mode, the switch 115 may beswitched to an intra. Alternatively, when an inter mode is used as aprediction mode, the switch 115 may be switched to an inter mode.Herein, the intra mode may mean an intra-prediction mode, and the intermode may mean an inter-prediction mode. The encoding apparatus 100 maygenerate a prediction block for an input block of the input image. Inaddition, the encoding apparatus 100 may encode a residual block using aresidual of the input block and the prediction block after theprediction block being generated. The input image may be called as acurrent image that is a current encoding target. The input block may becalled as a current block that is current encoding target, or as anencoding target block.

When a prediction mode is an intra mode, the intra-prediction unit 120may use a sample of a block that has been already encoded/decoded and isadjacent to a current block as a reference sample. The intra-predictionunit 120 may perform spatial prediction for the current block by using areference sample, or generate prediction samples of an input block byperforming spatial prediction. Herein, the intra prediction may meanintra-prediction,

When a prediction mode is an inter mode, the motion prediction unit 111may retrieve a region that best matches with an input block from areference image when performing motion prediction, and deduce a motionvector by using the retrieved region. In this case, a search region maybe used as the region. The reference image may be stored in thereference picture buffer 190. Here, when encoding/decoding for thereference image is performed, it may be stored in the reference picturebuffer 190.

The motion compensation unit 112 may generate a prediction block byperforming motion compensation for the current block using a motionvector. Herein, inter-prediction may mean inter-prediction or motioncompensation.

When the value of the motion vector is not an integer, the motionprediction unit 111 and the motion compensation unit 112 may generatethe prediction block by applying an interpolation filter to a partialregion of the reference picture. In order to perform inter-pictureprediction or motion compensation on a coding unit, it may be determinedthat which mode among a skip mode, a merge mode, an advanced motionvector prediction (AMVP) mode, and a current picture referring mode isused for motion prediction and motion compensation of a prediction unitincluded in the corresponding coding unit. Then, inter-pictureprediction or motion compensation may be differently performed dependingon the determined mode.

The subtractor 125 may generate a residual block by using a differenceof an input block and a prediction block. The residual block may becalled as a residual signal. The residual signal may mean a differencebetween an original signal and a prediction signal. In addition, theresidual signal may be a signal generated by transforming or quantizing,or transforming and quantizing a difference between the original signaland the prediction signal. The residual block may be a residual signalof a block unit.

The transform unit 130 may generate a transform coefficient byperforming transform of a residual block, and output the generatedtransform coefficient. Herein, the transform coefficient may be acoefficient value generated by performing transform of the residualblock. When a transform skip mode is applied, the transform unit 130 mayskip transform of the residual block.

A quantized level may be generated by applying quantization to thetransform coefficient or to the residual signal. Hereinafter, thequantized level may be also called as a transform coefficient inembodiments.

The quantization unit 140 may generate a quantized level by quantizingthe transform coefficient or the residual signal according to aparameter, and output the generated quantized level. Herein, thequantization unit 140 may quantize the transform coefficient by using aquantization matrix.

The entropy encoding unit 150 may generate a bitstream by performingentropy encoding according to a probability distribution on valuescalculated by the quantization unit 140 or on coding parameter valuescalculated when performing encoding, and output the generated bitstream.The entropy encoding unit 150 may perform entropy encoding of sampleinformation of an image and information for decoding an image. Forexample, the information for decoding the image may include a syntaxelement.

When entropy encoding is applied, symbols are represented so that asmaller number of bits are assigned to a symbol having a high chance ofbeing generated and a larger number of bits are assigned to a symbolhaving a low chance of being generated, and thus, the size of bit streamfor symbols to be encoded may be decreased. The entropy encoding unit150 may use an encoding method for entropy encoding such as exponentialGolomb, context-adaptive variable length coding (CAVLC),context-adaptive binary arithmetic coding (CABAC), etc. For example, theentropy encoding unit 150 may perform entropy encoding by using avariable length coding/code (VLC) table. In addition, the entropyencoding unit 150 may deduce a binarization method of a target symboland a probability model of a target symbol/bin, and perform arithmeticcoding by using the deduced binarization method, and a context model.

In order to encode a transform coefficient level (quantized level), theentropy encoding unit 150 may change a two-dimensional block formcoefficient into a one-dimensional vector form by using a transformcoefficient scanning method.

A coding parameter may include information (flag, index, etc.) such assyntax element that is encoded in an encoder and signaled to a decoder,and information derived when performing encoding or decoding. The codingparameter may mean information required when encoding or decoding animage. For example, at least one value or a combination form of aunit/block size, a unit/block depth, unit/block partition information,unit/block shape, unit/block partition structure, whether to partitionof a quad-tree form, whether to partition of a binary-tree form, apartition direction of a binary-tree form (horizontal direction orvertical direction), a partition form of a binary-tree form (symmetricpartition or asymmetric partition), whether or not a current coding unitis partitioned by ternary tree partitioning, direction (horizontal orvertical direction) of the ternary tree partitioning, type (symmetric orasymmetric type) of the ternary tree partitioning, whether a currentcoding unit is partitioned by multi-type tree partitioning, direction(horizontal or vertical direction) of the multi-type three partitioning,type (symmetric or asymmetric type) of the multi-type tree partitioning,and a tree (binary tree or ternary tree) structure of the multi-typetree partitioning, a prediction mode (intra prediction or interprediction), a luma intra-prediction mode/direction, a chromaintra-prediction mode/direction, intra partition information, interpartition information, a coding block partition flag, a prediction blockpartition flag, a transform block partition flag, a reference samplefiltering method, a reference sample filter tab, a reference samplefilter coefficient, a prediction block filtering method, a predictionblock filter tap, a prediction block filter coefficient, a predictionblock boundary filtering method, a prediction block boundary filter tab,a prediction block boundary filter coefficient, an intra-predictionmode, an inter-prediction mode, motion information, a motion vector, amotion vector difference, a reference picture index, a inter-predictionangle, an inter-prediction indicator, a prediction list utilizationflag, a reference picture list, a reference picture, a motion vectorpredictor index, a motion vector predictor candidate, a motion vectorcandidate list, whether to use a merge mode, a merge index, a mergecandidate, a merge candidate list, whether to use a skip mode, aninterpolation filter type, an interpolation filter tab, an interpolationfilter coefficient, a motion vector size, a presentation accuracy of amotion vector, a transform type, a transform size, information ofwhether or not a primary (first) transform is used, information ofwhether or not a secondary transform is used, a primary transform index,a secondary transform index, information of whether or not a residualsignal is present, a coded block pattern, a coded block flag (CBF), aquantization parameter, a quantization parameter residue, a quantizationmatrix, whether to apply an intra loop filter, an intra loop filtercoefficient, an intra loop filter tab, an intra loop filter shape/form,whether to apply a deblocking filter, a deblocking filter coefficient, adeblocking filter tab, a deblocking filter strength, a deblocking filtershape/form, whether to apply an adaptive sample offset, an adaptivesample offset value, an adaptive sample offset category, an adaptivesample offset type, whether to apply an adaptive loop filter, anadaptive loop filter coefficient, an adaptive loop filter tab, anadaptive loop filter shape/form, a binarization/inverse-binarizationmethod, a context model determining method, a context model updatingmethod, whether to perform a regular mode, whether to perform a bypassmode, a context bin, a bypass bin, a significant coefficient flag, alast significant coefficient flag, a coded flag for a unit of acoefficient group, a position of the last significant coefficient, aflag for whether a value of a coefficient is larger than 1, a flag forwhether a value of a coefficient is larger than 2, a flag for whether avalue of a coefficient is larger than 3, information on a remainingcoefficient value, a sign information, a reconstructed luma sample, areconstructed chroma sample, a residual luma sample, a residual chromasample, a luma transform coefficient, a chroma transform coefficient, aquantized luma level, a quantized chroma level, a transform coefficientlevel scanning method, a size of a motion vector search area at adecoder side, a shape of a motion vector search area at a decoder side,a number of time of a motion vector search at a decoder side,information on a CTU size, information on a minimum block size,information on a maximum block size, information on a maximum blockdepth, information on a minimum block depth, an imagedisplaying/outputting sequence, slice identification information, aslice type, slice partition information, tile identificationinformation, a tile type, tile partition information, tile groupidentification information, a tile group type, tile group partitioninformation, a picture type, a bit depth of an input sample, a bit depthof a reconstruction sample, a bit depth of a residual sample, a bitdepth of a transform coefficient, a bit depth of a quantized level, andinformation on a luma signal or information on a chroma signal may beincluded in the coding parameter.

Herein, signaling the flag or index may mean that a corresponding flagor index is entropy encoded and included in a bitstream by an encoder,and may mean that the corresponding flag or index is entropy decodedfrom a bitstream by a decoder.

When the encoding apparatus 100 performs encoding throughinter-prediction, an encoded current image may be used as a referenceimage for another image that is processed afterwards. Accordingly, theencoding apparatus 100 may reconstruct or decode the encoded currentimage, or store the reconstructed or decoded image as a reference imagein reference picture buffer 190.

A quantized level may be dequantized in the dequantization unit 160, ormay be inverse-transformed in the inverse-transform unit 170. Adequantized or inverse-transformed coefficient or both may be added witha prediction block by the adder 175. By adding the dequantized orinverse-transformed coefficient or both with the prediction block, areconstructed block may be generated. Herein, the dequantized orinverse-transformed coefficient or both may mean a coefficient on whichat least one of dequantization and inverse-transform is performed, andmay mean a reconstructed residual block.

A reconstructed block may pass through the filter unit 180. The filterunit 180 may apply at least one of a deblocking filter, a sampleadaptive offset (SAO), and an adaptive loop filter (ALF) to areconstructed sample, a reconstructed block or a reconstructed image.The filter unit 180 may be called as an in-loop filter.

The deblocking filter may remove block distortion generated inboundaries between blocks. In order to determine whether or not to applya deblocking filter, whether or not to apply a deblocking filter to acurrent block may be determined based samples included in several rowsor columns which are included in the block. When a deblocking filter isapplied to a block, another filter may be applied according to arequired deblocking filtering strength.

In order to compensate an encoding error, a proper offset value may beadded to a sample value by using a sample adaptive offset. The sampleadaptive offset may correct an offset of a deblocked image from anoriginal image by a sample unit. A method of partitioning samples of animage into a predetermined number of regions, determining a region towhich an offset is applied, and applying the offset to the determinedregion, or a method of applying an offset in consideration of edgeinformation on each sample may be used.

The adaptive loop filter may perform filtering based on a comparisonresult of the filtered reconstructed image and the original image.Samples included in an image may be partitioned into predeterminedgroups, a filter to be applied to each group may be determined, anddifferential filtering may be performed for each group. Information ofwhether or not to apply the ALF may be signaled by coding units (CUs),and a form and coefficient of the ALF to be applied to each block mayvary.

The reconstructed block or the reconstructed image having passed throughthe filter unit 180 may be stored in the reference picture buffer 190. Areconstructed block processed by the filter unit 180 may be a part of areference image. That is, a reference image is a reconstructed imagecomposed of reconstructed blocks processed by the filter unit 180. Thestored reference image may be used later in inter prediction or motioncompensation.

FIG. 2 is a block diagram showing a configuration of a decodingapparatus according to an embodiment and to which the present inventionis applied.

A decoding apparatus 200 may a decoder, a video decoding apparatus, oran image decoding apparatus.

Referring to FIG. 2, the decoding apparatus 200 may include an entropydecoding unit 210, a dequantization unit 220, an inverse-transform unit230, an intra-prediction unit 240, a motion compensation unit 250, anadder 225, a filter unit 260, and a reference picture buffer 270.

The decoding apparatus 200 may receive a bitstream output from theencoding apparatus 100. The decoding apparatus 200 may receive abitstream stored in a computer readable recording medium, or may receivea bitstream that is streamed through a wired/wireless transmissionmedium. The decoding apparatus 200 may decode the bitstream by using anintra mode or an inter mode. In addition, the decoding apparatus 200 maygenerate a reconstructed image generated through decoding or a decodedimage, and output the reconstructed image or decoded image.

When a prediction mode used when decoding is an intra mode, a switch maybe switched to an intra. Alternatively, when a prediction mode used whendecoding is an inter mode, a switch may be switched to an inter mode.

The decoding apparatus 200 may obtain a reconstructed residual block bydecoding the input bitstream, and generate a prediction block. When thereconstructed residual block and the prediction block are obtained, thedecoding apparatus 200 may generate a reconstructed block that becomes adecoding target by adding the reconstructed residual block with theprediction block. The decoding target block may be called a currentblock.

The entropy decoding unit 210 may generate symbols by entropy decodingthe bitstream according to a probability distribution. The generatedsymbols may include a symbol of a quantized level form. Herein, anentropy decoding method may be an inverse-process of the entropyencoding method described above.

In order to decode a transform coefficient level (quantized level), theentropy decoding unit 210 may change a one-directional vector formcoefficient into a two-dimensional block form by using a transformcoefficient scanning method.

A quantized level may be dequantized in the dequantization unit 220, orinverse-transformed in the inverse-transform unit 230. The quantizedlevel may be a result of dequantizing or inverse-transforming or both,and may be generated as a reconstructed residual block. Herein, thedequantization unit 220 may apply a quantization matrix to the quantizedlevel.

When an intra mode is used, the intra-prediction unit 240 may generate aprediction block by performing, for the current block, spatialprediction that uses a sample value of a block adjacent to a decodingtarget block and which has been already decoded.

When an inter mode is used, the motion compensation unit 250 maygenerate a prediction block by performing, for the current block, motioncompensation that uses a motion vector and a reference image stored inthe reference picture buffer 270.

The adder 225 may generate a reconstructed block by adding thereconstructed residual block with the prediction block. The filter unit260 may apply at least one of a deblocking filter, a sample adaptiveoffset, and an adaptive loop filter to the reconstructed block orreconstructed image. The filter unit 260 may output the reconstructedimage. The reconstructed block or reconstructed image may be stored inthe reference picture buffer 270 and used when performinginter-prediction. A reconstructed block processed by the filter unit 260may be a part of a reference image. That is, a reference image is areconstructed image composed of reconstructed blocks processed by thefilter unit 260. The stored reference image may be used later in interprediction or motion compensation.

FIG. 3 is a view schematically showing a partition structure of an imagewhen encoding and decoding the image. FIG. 3 schematically shows anexample of partitioning a single unit into a plurality of lower units.

In order to efficiently partition an image, when encoding and decoding,a coding unit (CU) may be used. The coding unit may be used as a basicunit when encoding/decoding the image. In addition, the coding unit maybe used as a unit for distinguishing an intra prediction mode and aninter prediction mode when encoding/decoding the image. The coding unitmay be a basic unit used for prediction, transform, quantization,inverse-transform, dequantization, or an encoding/decoding process of atransform coefficient.

Referring to FIG. 3, an image 300 is sequentially partitioned in alargest coding unit (LCU), and a LCU unit is determined as a partitionstructure. Herein, the LCU may be used in the same meaning as a codingtree unit (CTU). A unit partitioning may mean partitioning a blockassociated with to the unit. In block partition information, informationof a unit depth may be included. Depth information may represent anumber of times or a degree or both in which a unit is partitioned. Asingle unit may be partitioned into a plurality of lower level unitshierarchically associated with depth information based on a treestructure. In other words, a unit and a lower level unit generated bypartitioning the unit may correspond to a node and a child node of thenode, respectively. Each of partitioned lower unit may have depthinformation. Depth information may be information representing a size ofa CU, and may be stored in each CU. Unit depth represents times and/ordegrees related to partitioning a unit. Therefore, partitioninginformation of a lower-level unit may comprise information on a size ofthe lower-level unit.

A partition structure may mean a distribution of a coding unit (CU)within an LCU 310. Such a distribution may be determined according towhether or not to partition a single CU into a plurality (positiveinteger equal to or greater than 2 including 2, 4, 8, 16, etc.) of CUs.A horizontal size and a vertical size of the CU generated bypartitioning may respectively be half of a horizontal size and avertical size of the CU before partitioning, or may respectively havesizes smaller than a horizontal size and a vertical size beforepartitioning according to a number of times of partitioning. The CU maybe recursively partitioned into a plurality of CUs. By the recursivepartitioning, at least one among a height and a width of a CU afterpartitioning may decrease comparing with at least one among a height anda width of a CU before partitioning. Partitioning of the CU may berecursively performed until to a predefined depth or predefined size.For example, a depth of an LCU may be 0, and a depth of a smallestcoding unit (SCU) may be a predefined maximum depth. Herein, the LCU maybe a coding unit having a maximum coding unit size, and the SCU may be acoding unit having a minimum coding unit size as described above.Partitioning is started from the LCU 310, a CU depth increases by 1 as ahorizontal size or a vertical size or both of the CU decreases bypartitioning. For example, for each depth, a CU which is not partitionedmay have a size of 2N×2N. Also, in case of a CU which is partitioned, aCU with a size of 2N×2N may be partitioned into four CUs with a size ofN×N. A size of N may decrease to half as a depth increase by 1.

In addition, information whether or not the CU is partitioned may berepresented by using partition information of the CU. The partitioninformation may be 1-bit information. All CUs, except for a SCU, mayinclude partition information. For example, when a value of partitioninformation is a first value, the CU may not be partitioned, when avalue of partition information is a second value, the CU may bepartitioned

Referring to FIG. 3, an LCU having a depth 0 may be a 64×64 block. 0 maybe a minimum depth. A SCU having a depth 3 may be an 8×8 block. 3 may bea maximum depth. A CU of a 32×32 block and a 16×16 block may berespectively represented as a depth 1 and a depth 2.

For example, when a single coding unit is partitioned into four codingunits, a horizontal size and a vertical size of the four partitionedcoding units may be a half size of a horizontal and vertical size of theCU before being partitioned. In one embodiment, when a coding unithaving a 32×32 size is partitioned into four coding units, each of thefour partitioned coding units may have a 16×16 size. When a singlecoding unit is partitioned into four coding units, it may be called thatthe coding unit may be partitioned into a quad-tree form.

For example, when one coding unit is partitioned into two sub-codingunits, the horizontal or vertical size (width or height) of each of thetwo sub-coding units may be half the horizontal or vertical size of theoriginal coding unit. For example, when a coding unit having a size of32×32 is vertically partitioned into two sub-coding units, each of thetwo sub-coding units may have a size of 16×32. For example, when acoding unit having a size of 8×32 is horizontally partitioned into twosub-coding units, each of the two sub-coding units may have a size of8×16. When one coding unit is partitioned into two sub-coding units, itcan be said that the coding unit is binary-partitioned or is partitionedby a binary tree partition structure.

For example, when one coding unit is partitioned into three sub-codingunits, the horizontal or vertical size of the coding unit can bepartitioned with a ratio of 1:2:1, thereby producing three sub-codingunits whose horizontal or vertical sizes are in a ratio of 1:2:1. Forexample, when a coding unit having a size of 16×32 is horizontallypartitioned into three sub-coding units, the three sub-coding units mayhave sizes of 16×8, 16×16, and 16×8 respectively, in the order from theuppermost to the lowermost sub-coding unit. For example, when a codingunit having a size of 32×32 is vertically split into three sub-codingunits, the three sub-coding units may have sizes of 8×32, 16×32, and8×32, respectively in the order from the left to the right sub-codingunit. When one coding unit is partitioned into three sub-coding units,it can be said that the coding unit is ternary-partitioned orpartitioned by a ternary tree partition structure.

In FIG. 3, a coding tree unit (CTU) 320 is an example of a CTU to whicha quad tree partition structure, a binary tree partition structure, anda ternary tree partition structure are all applied.

As described above, in order to partition the CTU, at least one of aquad tree partition structure, a binary tree partition structure, and aternary tree partition structure may be applied. Various tree partitionstructures may be sequentially applied to the CTU, according to apredetermined priority order. For example, the quad tree partitionstructure may be preferentially applied to the CTU. A coding unit thatcannot be partitioned any longer using a quad tree partition structuremay correspond to a leaf node of a quad tree. A coding unitcorresponding to a leaf node of a quad tree may serve as a root node ofa binary and/or ternary tree partition structure. That is, a coding unitcorresponding to a leaf node of a quad tree may be further partitionedby a binary tree partition structure or a ternary tree partitionstructure, or may not be further partitioned. Therefore, by preventing acoding block that results from binary tree partitioning or ternary treepartitioning of a coding unit corresponding to a leaf node of a quadtree from undergoing further quad tree partitioning, block partitioningand/or signaling of partition information can be effectively performed.

The fact that a coding unit corresponding to a node of a quad tree ispartitioned may be signaled using quad partition information. The quadpartition information having a first value (e.g., “1”) may indicate thata current coding unit is partitioned by the quad tree partitionstructure. The quad partition information having a second value (e.g.,“0”) may indicate that a current coding unit is not partitioned by thequad tree partition structure. The quad partition information may be aflag having a predetermined length (e.g., one bit).

There may not be a priority between the binary tree partitioning and theternary tree partitioning. That is, a coding unit corresponding to aleaf node of a quad tree may further undergo arbitrary partitioningamong the binary tree partitioning and the ternary tree partitioning. Inaddition, a coding unit generated through the binary tree partitioningor the ternary tree partitioning may undergo a further binary treepartitioning or a further ternary tree partitioning, or may not befurther partitioned.

A tree structure in which there is no priority among the binary treepartitioning and the ternary tree partitioning is referred to as amulti-type tree structure. A coding unit corresponding to a leaf node ofa quad tree may serve as a root node of a multi-type tree. Whether topartition a coding unit which corresponds to a node of a multi-type treemay be signaled using at least one of multi-type tree partitionindication information, partition direction information, and partitiontree information. For partitioning of a coding unit corresponding to anode of a multi-type tree, the multi-type tree partition indicationinformation, the partition direction, and the partition tree informationmay be sequentially signaled.

The multi-type tree partition indication information having a firstvalue (e.g., “1”) may indicate that a current coding unit is to undergoa multi-type tree partitioning. The multi-type tree partition indicationinformation having a second value (e.g., “0”) may indicate that acurrent coding unit is not to undergo a multi-type tree partitioning.

When a coding unit corresponding to a node of a multi-type tree isfurther partitioned by a multi-type tree partition structure, the codingunit may include partition direction information. The partitiondirection information may indicate in which direction a current codingunit is to be partitioned for the multi-type tree partitioning. Thepartition direction information having a first value (e.g., “1”) mayindicate that a current coding unit is to be vertically partitioned. Thepartition direction information having a second value (e.g., “0”) mayindicate that a current coding unit is to be horizontally partitioned.

When a coding unit corresponding to a node of a multi-type tree isfurther partitioned by a multi-type tree partition structure, thecurrent coding unit may include partition tree information. Thepartition tree information may indicate a tree partition structure whichis to be used for partitioning of a node of a multi-type tree. Thepartition tree information having a first value (e.g., “1”) may indicatethat a current coding unit is to be partitioned by a binary treepartition structure. The partition tree information having a secondvalue (e.g., “0”) may indicate that a current coding unit is to bepartitioned by a ternary tree partition structure.

The partition indication information, the partition tree information,and the partition direction information may each be a flag having apredetermined length (e.g., one bit).

At least any one of the quadtree partition indication information, themulti-type tree partition indication information, the partitiondirection information, and the partition tree information may be entropyencoded/decoded. For the entropy-encoding/decoding of those types ofinformation, information on a neighboring coding unit adjacent to thecurrent coding unit may be used. For example, there is a highprobability that the partition type (the partitioned or non-partitioned,the partition tree, and/or the partition direction) of a leftneighboring coding unit and/or an upper neighboring coding unit of acurrent coding unit is similar to that of the current coding unit.Therefore, context information for entropy encoding/decoding of theinformation on the current coding unit may be derived from theinformation on the neighboring coding units. The information on theneighboring coding units may include at least any one of quad partitioninformation, multi-type tree partition indication information, partitiondirection information, and partition tree information.

As another example, among binary tree partitioning and ternary treepartitioning, binary tree partitioning may be preferentially performed.That is, a current coding unit may primarily undergo binary treepartitioning, and then a coding unit corresponding to a leaf node of abinary tree may be set as a root node for ternary tree partitioning. Inthis case, neither quad tree partitioning nor binary tree partitioningmay not be performed on the coding unit corresponding to a node of aternary tree.

A coding unit that cannot be partitioned by a quad tree partitionstructure, a binary tree partition structure, and/or a ternary treepartition structure becomes a basic unit for coding, prediction and/ortransformation. That is, the coding unit cannot be further partitionedfor prediction and/or transformation. Therefore, the partition structureinformation and the partition information used for partitioning a codingunit into prediction units and/or transformation units may not bepresent in a bit stream.

However, when the size of a coding unit (i.e., a basic unit forpartitioning) is larger than the size of a maximum transformation block,the coding unit may be recursively partitioned until the size of thecoding unit is reduced to be equal to or smaller than the size of themaximum transformation block. For example, when the size of a codingunit is 64×64 and when the size of a maximum transformation block is32×32, the coding unit may be partitioned into four 32×32 blocks fortransformation. For example, when the size of a coding unit is 32×64 andthe size of a maximum transformation block is 32×32, the coding unit maybe partitioned into two 32×32 blocks for the transformation. In thiscase, the partitioning of the coding unit for transformation is notsignaled separately, and may be determined through comparison betweenthe horizontal or vertical size of the coding unit and the horizontal orvertical size of the maximum transformation block. For example, when thehorizontal size (width) of the coding unit is larger than the horizontalsize (width) of the maximum transformation block, the coding unit may bevertically bisected. For example, when the vertical size (length) of thecoding unit is larger than the vertical size (length) of the maximumtransformation block, the coding unit may be horizontally bisected.

Information of the maximum and/or minimum size of the coding unit andinformation of the maximum and/or minimum size of the transformationblock may be signaled or determined at an upper level of the codingunit. The upper level may be, for example, a sequence level, a picturelevel, a slice level, a tile group level, a tile level, or the like. Forexample, the minimum size of the coding unit may be determined to be4×4. For example, the maximum size of the transformation block may bedetermined to be 64×64. For example, the minimum size of thetransformation block may be determined to be 4×4.

Information of the minimum size (quad tree minimum size) of a codingunit corresponding to a leaf node of a quad tree and/or information ofthe maximum depth (the maximum tree depth of a multi-type tree) from aroot node to a leaf node of the multi-type tree may be signaled ordetermined at an upper level of the coding unit. For example, the upperlevel may be a sequence level, a picture level, a slice level, a tilegroup level, a tile level, or the like. Information of the minimum sizeof a quad tree and/or information of the maximum depth of a multi-typetree may be signaled or determined for each of an intra-picture sliceand an inter-picture slice.

Difference information between the size of a CTU and the maximum size ofa transformation block may be signaled or determined at an upper levelof the coding unit. For example, the upper level may be a sequencelevel, a picture level, a slice level, a tile group level, a tile level,or the like. Information of the maximum size of the coding unitscorresponding to the respective nodes of a binary tree (hereinafter,referred to as a maximum size of a binary tree) may be determined basedon the size of the coding tree unit and the difference information. Themaximum size of the coding units corresponding to the respective nodesof a ternary tree (hereinafter, referred to as a maximum size of aternary tree) may vary depending on the type of slice. For example, foran intra-picture slice, the maximum size of a ternary tree may be 32×32.For example, for an inter-picture slice, the maximum size of a ternarytree may be 128×128. For example, the minimum size of the coding unitscorresponding to the respective nodes of a binary tree (hereinafter,referred to as a minimum size of a binary tree) and/or the minimum sizeof the coding units corresponding to the respective nodes of a ternarytree (hereinafter, referred to as a minimum size of a ternary tree) maybe set as the minimum size of a coding block.

As another example, the maximum size of a binary tree and/or the maximumsize of a ternary tree may be signaled or determined at the slice level.Alternatively, the minimum size of the binary tree and/or the minimumsize of the ternary tree may be signaled or determined at the slicelevel.

Depending on size and depth information of the above-described variousblocks, quad partition information, multi-type tree partition indicationinformation, partition tree information and/or partition directioninformation may be included or may not be included in a bit stream.

For example, when the size of the coding unit is not larger than theminimum size of a quad tree, the coding unit does not contain quadpartition information. Thus, the quad partition information may bededuced from a second value.

For example, when the sizes (horizontal and vertical sizes) of a codingunit corresponding to a node of a multi-type tree are larger than themaximum sizes (horizontal and vertical sizes) of a binary tree and/orthe maximum sizes (horizontal and vertical sizes) of a ternary tree, thecoding unit may not be binary-partitioned or ternary-partitioned.Accordingly, the multi-type tree partition indication information maynot be signaled but may be deduced from a second value.

Alternatively, when the sizes (horizontal and vertical sizes) of acoding unit corresponding to a node of a multi-type tree are the same asthe maximum sizes (horizontal and vertical sizes) of a binary treeand/or are two times as large as the maximum sizes (horizontal andvertical sizes) of a ternary tree, the coding unit may not be furtherbinary-partitioned or ternary-partitioned. Accordingly, the multi-typetree partition indication information may not be signaled but be derivedfrom a second value. This is because when a coding unit is partitionedby a binary tree partition structure and/or a ternary tree partitionstructure, a coding unit smaller than the minimum size of a binary treeand/or the minimum size of a ternary tree is generated.

Alternatively, the binary tree partitioning or the ternary treepartitioning may be limited on the basis of the size of a virtualpipeline data unit (hereinafter, a pipeline buffer size). For example,when the coding unit is divided into sub-coding units which do not fitthe pipeline buffer size by the binary tree partitioning or the ternarytree partitioning, the corresponding binary tree partitioning or ternarytree partitioning may be limited. The pipeline buffer size may be thesize of the maximum transform block (e.g., 64×64). For example, when thepipeline buffer size is 64×64, the division below may be limited.

-   -   N×M (N and/or M is 128) Ternary tree partitioning for coding        units    -   128×N (N<=64) Binary tree partitioning in horizontal direction        for coding units    -   N×128 (N<=64) Binary tree partitioning in vertical direction for        coding units

Alternatively, when the depth of a coding unit corresponding to a nodeof a multi-type tree is equal to the maximum depth of the multi-typetree, the coding unit may not be further binary-partitioned and/orternary-partitioned. Accordingly, the multi-type tree partitionindication information may not be signaled but may be deduced from asecond value.

Alternatively, only when at least one of vertical direction binary treepartitioning, horizontal direction binary tree partitioning, verticaldirection ternary tree partitioning, and horizontal direction ternarytree partitioning is possible for a coding unit corresponding to a nodeof a multi-type tree, the multi-type tree partition indicationinformation may be signaled. Otherwise, the coding unit may not bebinary-partitioned and/or ternary-partitioned. Accordingly, themulti-type tree partition indication information may not be signaled butmay be deduced from a second value.

Alternatively, only when both of the vertical direction binary treepartitioning and the horizontal direction binary tree partitioning orboth of the vertical direction ternary tree partitioning and thehorizontal direction ternary tree partitioning are possible for a codingunit corresponding to a node of a multi-type tree, the partitiondirection information may be signaled. Otherwise, the partitiondirection information may not be signaled but may be derived from avalue indicating possible partitioning directions.

Alternatively, only when both of the vertical direction binary treepartitioning and the vertical direction ternary tree partitioning orboth of the horizontal direction binary tree partitioning and thehorizontal direction ternary tree partitioning are possible for a codingunit corresponding to a node of a multi-type tree, the partition treeinformation may be signaled. Otherwise, the partition tree informationmay not be signaled but be deduced from a value indicating a possiblepartitioning tree structure.

FIG. 4 is a view showing an intra-prediction process.

Arrows from center to outside in FIG. 4 may represent predictiondirections of intra prediction modes.

Intra encoding and/or decoding may be performed by using a referencesample of a neighbor block of the current block. A neighbor block may bea reconstructed neighbor block. For example, intra encoding and/ordecoding may be performed by using an encoding parameter or a value of areference sample included in a reconstructed neighbor block.

A prediction block may mean a block generated by performing intraprediction. A prediction block may correspond to at least one among CU,PU and TU. A unit of a prediction block may have a size of one among CU,PU and TU. A prediction block may be a square block having a size of2×2, 4×4, 16×16, 32×32 or 64×64 etc. or may be a rectangular blockhaving a size of 2×8, 4×8, 2×16, 4×16 and 8×16 etc.

Intra prediction may be performed according to intra prediction mode forthe current block. The number of intra prediction modes which thecurrent block may have may be a fixed value and may be a valuedetermined differently according to an attribute of a prediction block.For example, an attribute of a prediction block may comprise a size of aprediction block and a shape of a prediction block, etc.

The number of intra-prediction modes may be fixed to N regardless of ablock size. Or, the number of intra prediction modes may be 3, 5, 9, 17,34, 35, 36, 65, or 67 etc. Alternatively, the number of intra-predictionmodes may vary according to a block size or a color component type orboth. For example, the number of intra prediction modes may varyaccording to whether the color component is a luma signal or a chromasignal. For example, as a block size becomes large, a number ofintra-prediction modes may increase. Alternatively, a number ofintra-prediction modes of a luma component block may be larger than anumber of intra-prediction modes of a chroma component block.

An intra-prediction mode may be a non-angular mode or an angular mode.The non-angular mode may be a DC mode or a planar mode, and the angularmode may be a prediction mode having a specific direction or angle. Theintra-prediction mode may be expressed by at least one of a mode number,a mode value, a mode numeral, a mode angle, and mode direction. A numberof intra-prediction modes may be M, which is larger than 1, includingthe non-angular and the angular mode.

In order to intra-predict a current block, a step of determining whetheror not samples included in a reconstructed neighbor block may be used asreference samples of the current block may be performed. When a samplethat is not usable as a reference sample of the current block ispresent, a value obtained by duplicating or performing interpolation onat least one sample value among samples included in the reconstructedneighbor block or both may be used to replace with a non-usable samplevalue of a sample, thus the replaced sample value is used as a referencesample of the current block.

FIG. 7 is a diagram illustrating reference samples capable of being usedfor intra prediction.

As shown in FIG. 7, at least one of the reference sample line 0 to thereference sample line 3 may be used for intra prediction of the currentblock. In FIG. 7, the samples of a segment A and a segment F may bepadded with the samples closest to a segment B and a segment E,respectively, instead of retrieving from the reconstructed neighboringblock. Index information indicating the reference sample line to be usedfor intra prediction of the current block may be signaled. When theupper boundary of the current block is the boundary of the CTU, only thereference sample line 0 may be available. Therefore, in this case, theindex information may not be signaled. When a reference sample lineother than the reference sample line 0 is used, filtering for aprediction block, which will be described later, may not be performed.

When intra-predicting, a filter may be applied to at least one of areference sample and a prediction sample based on an intra-predictionmode and a current block size.

In case of a planar mode, when generating a prediction block of acurrent block, according to a position of a prediction target samplewithin a prediction block, a sample value of the prediction targetsample may be generated by using a weighted sum of an upper and leftside reference sample of a current sample, and a right upper side andleft lower side reference sample of the current block. In addition, incase of a DC mode, when generating a prediction block of a currentblock, an average value of upper side and left side reference samples ofthe current block may be used. In addition, in case of an angular mode,a prediction block may be generated by using an upper side, a left side,a right upper side, and/or a left lower side reference sample of thecurrent block. In order to generate a prediction sample value,interpolation of a real number unit may be performed.

In the case of intra prediction between color components, a predictionblock for the current block of the second color component may begenerated on the basis of the corresponding reconstructed block of thefirst color component. For example, the first color component may be aluma component, and the second color component may be a chromacomponent. For intra prediction between color components, the parametersof the linear model between the first color component and the secondcolor component may be derived on the basis of the template. Thetemplate may include upper and/or left neighboring samples of thecurrent block and upper and/or left neighboring samples of thereconstructed block of the first color component corresponding thereto.For example, the parameters of the linear model may be derived using asample value of a first color component having a maximum value amongsamples in a template and a sample value of a second color componentcorresponding thereto, and a sample value of a first color componenthaving a minimum value among samples in the template and a sample valueof a second color component corresponding thereto. When the parametersof the linear model are derived, a corresponding reconstructed block maybe applied to the linear model to generate a prediction block for thecurrent block. According to a video format, subsampling may be performedon the neighboring samples of the reconstructed block of the first colorcomponent and the corresponding reconstructed block. For example, whenone sample of the second color component corresponds to four samples ofthe first color component, four samples of the first color component maybe sub-sampled to compute one corresponding sample. In this case, theparameter derivation of the linear model and intra prediction betweencolor components may be performed on the basis of the correspondingsub-sampled samples. Whether or not to perform intra prediction betweencolor components and/or the range of the template may be signaled as theintra prediction mode.

The current block may be partitioned into two or four sub-blocks in thehorizontal or vertical direction. The partitioned sub-blocks may besequentially reconstructed. That is, the intra prediction may beperformed on the sub-block to generate the sub-prediction block. Inaddition, dequantization and/or inverse transform may be performed onthe sub-blocks to generate sub-residual blocks. A reconstructedsub-block may be generated by adding the sub-prediction block to thesub-residual block. The reconstructed sub-block may be used as areference sample for intra prediction of the sub-sub-blocks. Thesub-block may be a block including a predetermined number (for example,16) or more samples. Accordingly, for example, when the current block isan 8×4 block or a 4×8 block, the current block may be partitioned intotwo sub-blocks. Also, when the current block is a 4×4 block, the currentblock may not be partitioned into sub-blocks. When the current block hasother sizes, the current block may be partitioned into four sub-blocks.Information on whether or not to perform the intra prediction based onthe sub-blocks and/or the partitioning direction (horizontal orvertical) may be signaled. The intra prediction based on the sub-blocksmay be limited to be performed only when reference sample line 0 isused. When the intra prediction based on the sub-block is performed,filtering for the prediction block, which will be described later, maynot be performed.

The final prediction block may be generated by performing filtering onthe prediction block that is intra-predicted. The filtering may beperformed by applying predetermined weights to the filtering targetsample, the left reference sample, the upper reference sample, and/orthe upper left reference sample. The weight and/or the reference sample(range, position, etc.) used for the filtering may be determined on thebasis of at least one of a block size, an intra prediction mode, and aposition of the filtering target sample in the prediction block. Thefiltering may be performed only in the case of a predetermined intraprediction mode (e.g., DC, planar, vertical, horizontal, diagonal,and/or adjacent diagonal modes). The adjacent diagonal mode may be amode in which k is added to or subtracted from the diagonal mode. Forexample, k may be a positive integer of 8 or less.

An intra-prediction mode of a current block may be entropyencoded/decoded by predicting an intra-prediction mode of a blockpresent adjacent to the current block. When intra-prediction modes ofthe current block and the neighbor block are identical, information thatthe intra-prediction modes of the current block and the neighbor blockare identical may be signaled by using predetermined flag information.In addition, indicator information of an intra-prediction mode that isidentical to the intra-prediction mode of the current block amongintra-prediction modes of a plurality of neighbor blocks may besignaled. When intra-prediction modes of the current block and theneighbor block are different, intra-prediction mode information of thecurrent block may be entropy encoded/decoded by performing entropyencoding/decoding based on the intra-prediction mode of the neighborblock.

FIG. 5 is a diagram illustrating an embodiment of an inter-pictureprediction process.

In FIG. 5, a rectangle may represent a picture. In FIG. 5, an arrowrepresents a prediction direction. Pictures may be categorized intointra pictures (I pictures), predictive pictures (P pictures), andBi-predictive pictures (B pictures) according to the encoding typethereof.

The I picture may be encoded through intra-prediction without requiringinter-picture prediction. The P picture may be encoded throughinter-picture prediction by using a reference picture that is present inone direction (i.e., forward direction or backward direction) withrespect to a current block. The B picture may be encoded throughinter-picture prediction by using reference pictures that are preset intwo directions (i.e., forward direction and backward direction) withrespect to a current block. When the inter-picture prediction is used,the encoder may perform inter-picture prediction or motion compensationand the decoder may perform the corresponding motion compensation.

Hereinbelow, an embodiment of the inter-picture prediction will bedescribed in detail.

The inter-picture prediction or motion compensation may be performedusing a reference picture and motion information.

Motion information of a current block may be derived duringinter-picture prediction by each of the encoding apparatus 100 and thedecoding apparatus 200. The motion information of the current block maybe derived by using motion information of a reconstructed neighboringblock, motion information of a collocated block (also referred to as acol block or a co-located block), and/or a block adjacent to theco-located block. The co-located block may mean a block that is locatedspatially at the same position as the current block, within a previouslyreconstructed collocated picture (also referred to as a col picture or aco-located picture). The co-located picture may be one picture among oneor more reference pictures included in a reference picture list.

The derivation method of the motion information may be differentdepending on the prediction mode of the current block. For example, aprediction mode applied for inter prediction includes an AMVP mode, amerge mode, a skip mode, a merge mode with a motion vector difference, asubblock merge mode, a triangle partition mode, an inter-intracombination prediction mode, affine mode, and the like. Herein, themerge mode may be referred to as a motion merge mode.

For example, when the AMVP is used as the prediction mode, at least oneof motion vectors of the reconstructed neighboring blocks, motionvectors of the co-located blocks, motion vectors of blocks adjacent tothe co-located blocks, and a (0, 0) motion vector may be determined asmotion vector candidates for the current block, and a motion vectorcandidate list is generated by using the emotion vector candidates. Themotion vector candidate of the current block can be derived by using thegenerated motion vector candidate list. The motion information of thecurrent block may be determined based on the derived motion vectorcandidate. The motion vectors of the collocated blocks or the motionvectors of the blocks adjacent to the collocated blocks may be referredto as temporal motion vector candidates, and the motion vectors of thereconstructed neighboring blocks may be referred to as spatial motionvector candidates.

The encoding apparatus 100 may calculate a motion vector difference(MVD) between the motion vector of the current block and the motionvector candidate and may perform entropy encoding on the motion vectordifference (MVD). In addition, the encoding apparatus 100 may performentropy encoding on a motion vector candidate index and generate abitstream. The motion vector candidate index may indicate an optimummotion vector candidate among the motion vector candidates included inthe motion vector candidate list. The decoding apparatus may performentropy decoding on the motion vector candidate index included in thebitstream and may select a motion vector candidate of a decoding targetblock from among the motion vector candidates included in the motionvector candidate list by using the entropy-decoded motion vectorcandidate index. In addition, the decoding apparatus 200 may add theentropy-decoded MVD and the motion vector candidate extracted throughthe entropy decoding, thereby deriving the motion vector of the decodingtarget block.

Meanwhile, the coding apparatus 100 may perform entropy-coding onresolution information of the calculated MVD. The decoding apparatus 200may adjust the resolution of the entropy-decoded MVD using the MVDresolution information.

Meanwhile, the coding apparatus 100 calculates a motion vectordifference (MVD) between a motion vector and a motion vector candidatein the current block on the basis of an affine model, and performsentropy-coding on the MVD. The decoding apparatus 200 derives a motionvector on a per sub-block basis by deriving an affine control motionvector of a decoding target block through the sum of the entropy-decodedMVD and an affine control motion vector candidate.

The bitstream may include a reference picture index indicating areference picture. The reference picture index may be entropy-encoded bythe encoding apparatus 100 and then signaled as a bitstream to thedecoding apparatus 200. The decoding apparatus 200 may generate aprediction block of the decoding target block based on the derivedmotion vector and the reference picture index information.

Another example of the method of deriving the motion information of thecurrent block may be the merge mode. The merge mode may mean a method ofmerging motion of a plurality of blocks. The merge mode may mean a modeof deriving the motion information of the current block from the motioninformation of the neighboring blocks. When the merge mode is applied,the merge candidate list may be generated using the motion informationof the reconstructed neighboring blocks and/or the motion information ofthe collocated blocks. The motion information may include at least oneof a motion vector, a reference picture index, and an inter-pictureprediction indicator. The prediction indicator may indicateone-direction prediction (L0 prediction or L1 prediction) ortwo-direction predictions (L0 prediction and L1 prediction).

The merge candidate list may be a list of motion information stored. Themotion information included in the merge candidate list may be at leastone of motion information (spatial merge candidate) of a neighboringblock adjacent to the current block, motion information (temporal mergecandidate) of the collocated block of the current block in the referencepicture, new motion information generated by a combination of the motioninformation existing in the merge candidate list, motion information(history-based merge candidate) of the block that is encoded/decodedbefore the current block, and zero merge candidate.

The encoding apparatus 100 may generate a bitstream by performingentropy encoding on at least one of a merge flag and a merge index andmay signal the bitstream to the decoding apparatus 200. The merge flagmay be information indicating whether or not to perform the merge modefor each block, and the merge index may be information indicating thatwhich neighboring block, among the neighboring blocks of the currentblock, is a merge target block. For example, the neighboring blocks ofthe current block may include a left neighboring block on the left sideof the current block, an upper neighboring block disposed above thecurrent block, and a temporal neighboring block temporally adjacent tothe current block.

Meanwhile, the coding apparatus 100 performs entropy-coding on thecorrection information for correcting the motion vector among the motioninformation of the merge candidate and signals the same to the decodingapparatus 200. The decoding apparatus 200 can correct the motion vectorof the merge candidate selected by the merge index on the basis of thecorrection information. Here, the correction information may include atleast one of information on whether or not to perform the correction,correction direction information, and correction size information. Asdescribed above, the prediction mode that corrects the motion vector ofthe merge candidate on the basis of the signaled correction informationmay be referred to as a merge mode having the motion vector difference.

The skip mode may be a mode in which the motion information of theneighboring block is applied to the current block as it is. When theskip mode is applied, the encoding apparatus 100 may perform entropyencoding on information of the fact that the motion information of whichblock is to be used as the motion information of the current block togenerate a bit stream, and may signal the bitstream to the decodingapparatus 200. The encoding apparatus 100 may not signal a syntaxelement regarding at least any one of the motion vector differenceinformation, the encoding block flag, and the transform coefficientlevel to the decoding apparatus 200.

The subblock merge mode may mean a mode that derives the motioninformation in units of sub-blocks of a coding block (CU). When thesubblock merge mode is applied, a subblock merge candidate list may begenerated using motion information (sub-block based temporal mergecandidate) of the sub-block collocated to the current sub-block in thereference image and/or an affine control point motion vector mergecandidate.

The triangle partition mode may mean a mode that derives motioninformation by partitioning the current block into diagonal directions,derives each prediction sample using each of the derived motioninformation, and derives the prediction sample of the current block byweighting each of the derived prediction samples.

The inter-intra combined prediction mode may mean a mode that derives aprediction sample of the current block by weighting a prediction samplegenerated by inter prediction and a prediction sample generated by intraprediction.

The decoding apparatus 200 may correct the derived motion information byitself. The decoding apparatus 200 may search the predetermined regionon the basis of the reference block indicated by the derived motioninformation and derive the motion information having the minimum SAD asthe corrected motion information.

The decoding apparatus 200 may compensate a prediction sample derivedvia inter prediction using an optical flow.

FIG. 6 is a diagram illustrating a transform and quantization process.

As illustrated in FIG. 6, a transform and/or quantization process isperformed on a residual signal to generate a quantized level signal. Theresidual signal is a difference between an original block and aprediction block (i.e., an intra prediction block or an inter predictionblock). The prediction block is a block generated through intraprediction or inter prediction. The transform may be a primarytransform, a secondary transform, or both. The primary transform of theresidual signal results in transform coefficients, and the secondarytransform of the transform coefficients results in secondary transformcoefficients.

At least one scheme selected from among various transform schemes whichare preliminarily defined is used to perform the primary transform. Forexample, examples of the predefined transform schemes include discretecosine transform (DCT), discrete sine transform (DST), andKarhunen-Loeve transform (KLT). The transform coefficients generatedthrough the primary transform may undergo the secondary transform. Thetransform schemes used for the primary transform and/or the secondarytransform may be determined according to coding parameters of thecurrent block and/or neighboring blocks of the current block.Alternatively, transform information indicating the transform scheme maybe signaled. The DCT-based transform may include, for example, DCT-2,DCT-8, and the like. The DST-based transform may include, for example,DST-7.

A quantized-level signal (quantization coefficients) may be generated byperforming quantization on the residual signal or a result of performingthe primary transform and/or the secondary transform. The quantizedlevel signal may be scanned according to at least one of a diagonalup-right scan, a vertical scan, and a horizontal scan, depending on anintra prediction mode of a block or a block size/shape. For example, asthe coefficients are scanned in a diagonal up-right scan, thecoefficients in a block form change into a one-dimensional vector form.Aside from the diagonal up-right scan, the horizontal scan ofhorizontally scanning a two-dimensional block form of coefficients orthe vertical scan of vertically scanning a two-dimensional block form ofcoefficients may be used depending on the intra prediction mode and/orthe size of a transform block. The scanned quantized-level coefficientsmay be entropy-encoded to be inserted into a bitstream.

A decoder entropy-decodes the bitstream to obtain the quantized-levelcoefficients. The quantized-level coefficients may be arranged in atwo-dimensional block form through inverse scanning. For the inversescanning, at least one of a diagonal up-right scan, a vertical scan, anda horizontal scan may be used.

The quantized-level coefficients may then be dequantized, then besecondary-inverse-transformed as necessary, and finally beprimary-inverse-transformed as necessary to generate a reconstructedresidual signal.

Inverse mapping in a dynamic range may be performed for a luma componentreconstructed through intra prediction or inter prediction beforein-loop filtering. The dynamic range may be divided into 16 equal piecesand the mapping function for each piece may be signaled. The mappingfunction may be signaled at a slice level or a tile group level. Aninverse mapping function for performing the inverse mapping may bederived on the basis of the mapping function. In-loop filtering,reference picture storage, and motion compensation are performed in aninverse mapped region, and a prediction block generated through interprediction is converted into a mapped region via mapping using themapping function, and then used for generating the reconstructed block.However, since the intra prediction is performed in the mapped region,the prediction block generated via the intra prediction may be used forgenerating the reconstructed block without mapping/inverse mapping.

When the current block is a residual block of a chroma component, theresidual block may be converted into an inverse mapped region byperforming scaling on the chroma component of the mapped region. Theavailability of the scaling may be signaled at the slice level or thetile group level. The scaling may be applied only when the mapping forthe luma component is available and the division of the luma componentand the division of the chroma component follow the same tree structure.The scaling may be performed on the basis of an average of sample valuesof a luma prediction block corresponding to the color difference block.In this case, when the current block uses inter prediction, the lumaprediction block may mean a mapped luma prediction block. A valuenecessary for the scaling may be derived by referring to a lookup tableusing an index of a piece to which an average of sample values of a lumaprediction block belongs. Finally, by scaling the residual block usingthe derived value, the residual block may be switched to the inversemapped region. Then, chroma component block restoration, intraprediction, inter prediction, in-loop filtering, and reference picturestorage may be performed in the inverse mapped area.

Information indicating whether the mapping/inverse mapping of the lumacomponent and chroma component is available may be signaled through aset of sequence parameters.

The prediction block of the current block may be generated on the basisof a block vector indicating a displacement between the current blockand the reference block in the current picture. In this way, aprediction mode for generating a prediction block with reference to thecurrent picture is referred to as an intra block copy (IBC) mode. TheIBC mode may be applied to M×N (M<=64, N<=64) coding units. The IBC modemay include a skip mode, a merge mode, an AMVP mode, and the like. Inthe case of a skip mode or a merge mode, a merge candidate list isconstructed, and the merge index is signaled so that one merge candidatemay be specified. The block vector of the specified merge candidate maybe used as a block vector of the current block. The merge candidate listmay include at least one of a spatial candidate, a history-basedcandidate, a candidate based on an average of two candidates, and azero-merge candidate. In the case of an AMVP mode, the difference blockvector may be signaled. In addition, the prediction block vector may bederived from the left neighboring block and the upper neighboring blockof the current block. The index on which neighboring block to use may besignaled. The prediction block in the IBC mode is included in thecurrent CTU or the left CTU and limited to a block in the alreadyreconstructed area. For example, a value of the block vector may belimited such that the prediction block of the current block ispositioned in an area of three 64×64 blocks preceding the 64×64 block towhich the current block belongs in the coding/decoding order. Bylimiting the value of the block vector in this way, memory consumptionand device complexity according to the IBC mode implementation may bereduced.

FIG. 8 is a diagram illustrating an image encoding/decoding processperformed on a CTU basis, according to one embodiment of the presentinvention.

An image encoding/decoding apparatus divides an input picture intocoding tree units (CTUs) and performs encoding/decoding on a CTU basis.Referring to FIG. 8, a 64×64-size CTU may be divided into quadtree (QT)coding units (CUs) and encoding/decoding may be performed on a CU basis.For example, the CUs are encoded/decoded in order indicated by a solidline, starting with the top left CU. The encoding/decoding orderillustrated in FIG. 8 is referred to as Z-scan order. In FIG. 8, adotted line indicates the progress of encoding/decoding from the currentCTU to the next CTU. That is, when the encoding/decoding of the currentCTU is completed, the next CTU is encoded/decoded.

The largest size of CTUs and the smallest size of CUs vary depending ona value signaled in a high-level syntax such as a sequence parameter set(SPS), an adaptation parameter set (APS), a picture parameter set (PPS),a sub-picture header, a tile header, a tile group header, or a sequenceparameter set. A residual signal, which is the difference between aninput picture (input signal) and a predicted signal, undergoestransform, quantization, and entropy coding in this order, and theresulting signal is transmitted to the image decoding apparatus.

Here, the term “adaption parameter set” refers to a parameter setreferred to by several pictures, several subpictures, several tilegroups, several tiles, several slices, several CTU lines, several CTUs,and the like.

The term APS also refers to a parameter set referred to and shared bydifferent pictures, subpictures, slices, tile groups, tiles, or CTUlines. Further, subpictures, slices, tile groups, tiles, or CTU lines ina picture may refer to different adaption parameter sets to useinformation in the different adaption parameter sets.

As to the adaptation parameter sets, subpictures, slices, tile groups,tiles, or CTU lines in a picture may refer to different adaptationparameter sets using adaptation parameter set identifiers.

As to the adaptation parameter sets, slices, tile groups, tiles, or CTUlines in a subpicture may refer to different adaptation parameter setsusing adaptation parameter set identifiers.

As to the adaptation parameter sets, tiles or CTU lines in a slice mayrefer to different adaptation parameter sets using adaptation parameterset identifiers.

As to the adaptation parameter sets, CTU lines in a tile may refer todifferent adaptation parameter sets using adaptation parameter setidentifiers.

The parameter set or header of a subpicture contains information of anadaption parameter set identifier so that an adaption parameter setcorresponding to the adaption parameter set identifier can be used forprocessing of the subpicture.

The parameter set or header of a tile contains an adaption parameter setidentifier so that an adaption parameter set corresponding to theadaption parameter set identifier can be used for processing of thetile.

The header of a CTU line includes an adaption parameter set identifierso that an adaption parameter set corresponding to the adaptionparameter set identifier can be used for processing of the CTU line.

A picture may be divided into one or more tile rows and one or more tilecolumns.

A subpicture in a picture may be divided into one or more tile rows andone or more tile columns. A subpicture is a rectangular or square regionin a picture and includes one or more CTUs. A subpicture may one or moretiles, CTU lines, and/or slices.

A tile is a rectangular or square region in a picture and includes oneor more CTUs. A tile may be divided into one or more CTU lines.

A CTU line may mean one or more CTU rows in a tile. A tile may bedivided into one or more CTU lines, and each CTU line may include one ormore CTU rows. A tile that is not divided into two or more CTU lines isalso referred to as a CTU line. A CTU line may include one or more CTUrows.

A slice in a picture may include one or more tiles. A slice in a tilemay include one or more CTU lines.

In a quantization process, quantization is performed on transformcoefficients, in which quantized transform coefficients (levels) aredetermined by a quantization parameter (QP). Here, the term“quantization parameter” means a quantized parameter.

To use quantization parameters on a block basis, a delta quantizationparameter enablement flag cu_qp_delta_enabled_flag is signaled in ahigh-level syntax element.

When the flag has a first value of 1, quantization group sizeinformation diff_cu_qp_delta_depth may be signaled. Here, thequantization group size information diff_cu_qp_delta_depth means depthinformation of a quantization group. Alternatively, the first value maybe 0 or an integer. For example, the first value may be 1.

According to one embodiment of the present invention, it is possible todetermine the size of a quantization group (QG) on the basis of sizeinformation of a quantization group. A delta quantization parameter maybe signaled for each quantization group size.

Table 1 shows quantization group sizes determined on the basis of thesize of a CTU and size information of a quantization group.

TABLE 1 size of size of size of quantization quantization quantizationgroup group group according to according to according to diff_cu- sizeof 64x64 size of 32x32 size of 16x16 delta_depth CTU CTU CTU 0 64x6432x32 16x16 1 32x32 16x16 8x8 2 16x16 8x8 — 3 8x8 — —

The delta quantization parameters may be signaled as a syntax elementscu_qb_delta_abs specifying the absolute value of the delta quantizationparameter and/or a syntax element cu_gb_delta_sign_flag specifying thesign of the delta quantization parameter. At least one of the syntaxelements of the delta quantization parameter may be signaled on a basisof quantization group defined as diff_cu_gb_delta_depth which is sizeinformation of a quantization group.

According to one embodiment, when a size of a block is equal to orlarger than a size of a quantization group, at least one deltaquantization parameter may be signaled for the block. One or more blocksamong the blocks disposed inside a quantization group may share the samedelta quantization parameter. A predicted quantization parameter for oneor more blocks among blocks disposed inside a quantization group may bederived from one or more quantization parameters of respectiveneighboring quantization groups. When at least one of the neighboringquantization groups is not available, the immediately previousquantization in encoding/decoding order, or the quantization parametersignaled in a syntax element of a higher level such as a picture,subpicture, slice, tile group, tile, CTU column, CTU row, or CTU line isused instead of the quantization parameter of the non-existingquantization group. In addition, one or more blocks among the blocksdisposed inside the quantization group may share a predictedquantization parameter which is equal to the predicted quantizationparameter. A quantization parameter is obtained by adding the deltaquantization parameter and the predicted quantization parameter.Accordingly, one or more blocks among the blocks disposed inside thequantization group may share the same quantization parameter.

According to one embodiment of the present invention, when the size of ablock is smaller than the size of a quantization group, a deltaquantization parameter may be signaled from the first block within thequantization group, the first block having a coding block flagcoded_block_flag that is not a first value. Here, the first value may be0.

For example, when the coding block flag of a block is not a secondvalue, a delta quantization parameter may not be signaled. Here, thesecond value may be 1.

Specifically, for example, in a case where a CTU size is 64×64, wherequantization group size information is diff_cu_qp_delta_depth=1, andthere are four 16×16 blocks in one 32×32 quantization group, aquantization parameter is signaled only from the first block in thequantization group, and at least one of the other blocks in thequantization group shares a delta quantization parameter signaled fromthe first block. Here, the first block may mean the first block amongblocks of which the coding block flag is not the first value. Here, thefirst value may be 0.

For another specific example, in a case where a CTU size is 64×64, wherequantization group size information is diff_cu_qp_delta_depth=1, andthere are four 16×16 blocks in one 32×32 quantization group, aquantization parameter is signaled only from the n-th block in thequantization group, and at least one of the other blocks in thequantization group shares a delta quantization parameter signaled fromthe n-th block. Here, the n-th block may mean the n-th block of whichthe coding block flag is not a first value. Here, the first value may be0. Here, the n is an integer greater than 1.

The coding block flag may mean a coding block flag for at least one of aluma signal (Y) and chroma signals Cb and Cr.

FIG. 9A is a flowchart illustrating an image decoding method accordingto one embodiment of the present invention.

Referring to FIG. 9A, an image decoding apparatus decodes sizeinformation of a quantization group from a bitstream (S901).

Here, the size information of a quantization group includes at least oneof depth information of the quantization group, length information ofthe quantization group, area information of the quantization group,ratio information of the quantization group, type information of thequantization group, subdivision information of the quantization group.

The quantization group may include a square quantization group or anon-square quantization group.

The non-square quantization group may have a shape based on at least oneof a quadtree structure and a ternary tree structure.

The image decoding apparatus may acquire a delta quantization parameterof a current block from size information of the quantization group(S902).

For example, the size of the quantization group may be determined on thebasis of the size information of the quantization group, and the deltaquantization parameter of the current block may be obtained on the basisof the size of the quantization group. In this case, the deltaquantization parameter of the current block may be decoded, on the basisof the size of the quantization group.

The image decoding apparatus may derive a quantization parameter of thecurrent block from the size information of the quantization group(S903).

For example, the delta quantization parameter of the current block maybe acquired on the basis of a relationship between the depth of thecurrent block and the depth information of the quantization group.

For example, the delta quantization parameter of the current block maybe acquired on the basis of a size relationship of the quantizationgroup which is set between the area of the current block and the areainformation of the quantization group.

For example, the delta quantization parameter of the current block isacquired on the basis of a relationship between the subdivision value ofthe current block and the subdivision information of the quantizationgroup.

Here, the subdivision value of the current block is equal to two plus apre-subdivision value when the current block is quadtree-partitioned.

The subdivision value of the current block is equal to one plus apre-subdivision value when the current block is a binarytree-partitioned.

The delta quantization parameter and the predicted quantizationparameter may be added to derive a quantization parameter of the currentblock.

FIG. 9B is a flowchart illustrating an image encoding method accordingto one embodiment of the present invention.

Referring to FIG. 9B, the image encoding apparatus determines a size ofa quantization group (S911).

Here, the size information of a quantization group includes at least oneof depth information of the quantization group, length information ofthe quantization group, area information of the quantization group,ratio information of the quantization group, type information of thequantization group, subdivision information of the quantization group.

The quantization group may include a square quantization group or anon-square quantization group.

The non-square quantization group may have a shape based on at least oneof a binary tree structure and a ternary tree structure.

The image encoding apparatus may determine a quantization parameter of acurrent block on the basis of the size the quantization group (S912).

The image encoding apparatus may derive a delta quantization parameterof the current block from the quantization parameter (S913).

For example, the delta quantization parameter of the current block maybe derived on the basis of the relationship between the depth of thecurrent block and the depth information of the quantization group.

For example, the delta quantization parameter of the current block maybe derived on the basis of a size relationship of the quantization groupwhich is set between the area of the current block and the areainformation of the quantization group.

For example, the delta quantization parameter of the current block maybe derived on the basis of a relationship between the subdivision valueof the current block and the subdivision information of the quantizationgroup.

Here, the subdivision value of the current block is equal to two plus apre-subdivision value when the current block is quadtree-partitioned.

The subdivision value of the current block is equal to one plus apre-subdivision value when the current block is a binarytree-partitioned.

The delta quantization parameter may be derived by subtracting thepredicted quantization parameter from the quantization parameter of thecurrent block.

The image encoding apparatus may encode the size information of thequantization group (S914). The delta quantization parameter of thecurrent block may be coded, on the basis of the size information of thequantization group.

According to one embodiment of the present invention, an imageencoding/decoding method and apparatus performs the steps of determininga size of a quantization group, determining a quantization parameter,and/or encoding/decoding size information of the quantization groupand/or delta quantization parameter information. The encoding/decodingmay mean entropy coding/decoding.

Hereinbelow, the step of determining the size of a quantization groupwill be described.

An encoder/decoder may determine the size of a quantization group.

For example, the encoder determines the size of a quantization group tobe used at the time of encoding/decoding by using the size set by theuser or the size determined by a predetermined rule.

Alternatively, the decoder may determine the size of a quantizationgroup on the basis of at least one of various sizes indicated byquantization group size information obtained by entropy-decoding abitstream.

Further alternatively, the decoder may determine the size of aquantization group according to a predetermined rule.

Yet further alternatively, the encoder/decoder may determine the size ofa quantization group on the basis of a previously set size.

Here, the term “quantization group” means a region in which one or moreprocessing units share the same quantization parameter. The quantizationgroup may include at least one CU, PU, TU, and/or block. Accordingly,the CU(s), PU(s), TU(s), and/or block(s) within the quantization groupuses the same quantization parameter. The block may be a predefinedblock.

The size of a quantization group (hereinafter, “size of a quantizationgroup” will be referred to as quantization group size for convenience ofa description) may be determined according to at least one selected fromamong the depth, length, area, ratio, shape, and subdivision.

The size information of a quantization group may refer to at least oneamong depth information, length information, area information, ratioinformation, shape information, and subdivision information of aquantization group. A quantization group may have a square shape or anon-square shape such as a rectangular shape and a triangular shape.

Examples of the non-square shape include a binary tree, a ternary tree,and at least one block generated through binary tree or ternary treepartitioning.

The size information of a quantization group may refer to anycombination of the depth information, the length information, the areainformation, the ratio information, the shape information, and thesubdivision information of the quantization group.

The multi-type tree may refer to a binary tree, a ternary tree, or both.

A block depth (i.e., the depth of a block) may mean at least one of thedepth of a quadtree, the depth of a binary tree, and the depth of aternary tree, or the sum of the depths of two or more trees of thosetrees.

The depth of a multi-type tree may mean at least one of the depth of abinary tree and the depth of a ternary tree, or the sum of the depths oftwo or more trees. The depth of a multi-type tree may mean the depth ofa binary tree. The depth of a multi-type tree may mean the depth of aternary tree.

For example, when a block can have a square shape and a non-squareshape, the depth of the block may mean at least one of the depth of aquadtree and the depth of a multi-type tree, or the sum of the depths oftwo or more trees. That is, the depth of a block may mean at least oneof the depth of a quadtree, the depth of a binary tree, and the depth ofa ternary tree, or the sum of the depths of two or more threesthereamong.

On the other hand, when a block can have only a square shape, the depthof the block means only the depth of a quadtree.

On the other hand, when a block can have only a non-square shape, thedepth of the block means only the depth of a multi-type tree. That is,the depth of a block may mean at least one of the depth of a binary treeand the depth of a ternary tree, or may mean the sum of the depths oftwo or more trees thereamong.

Hereinbelow, the step of determining a quantization parameter will bedescribed.

At the encoder/decoder, the quantization parameter may be determined.

For example, at the encoder, the quantization parameter may be set bythe user or may be determined according to a predetermined rule.

For example, at the decoder, the quantization parameter may be obtainedby adding a predicted quantization parameter that is derived throughprediction on the basis of a neighboring quantization group of a currentquantization group and a delta quantization parameter. The deltaquantization parameter may mean information of a delta quantizationparameter obtained through decoding of a bitstream.

When at least one of the neighboring quantization groups of the currentquantization group is not available, the quantization parameter of thequantization group corresponding to the previous position in theencoding/decoding may be used as the predicted quantization parameter ofthe current quantization group instead of the quantization parameter ofthe neighboring quantization group corresponding to the unavailableposition.

When at least one of the neighboring quantization groups of the currentquantization group is not available, the quantization parameter of thequantization group corresponding to the previous position in thedecoding/decoding may be used as the quantization parameter that is usedfor calculation of the predicted quantization parameter of the currentquantization group instead of the quantization parameter of theneighboring quantization group corresponding to the unavailableposition.

When at least one of the neighboring quantization groups of the currentquantization group does not exist, the quantization parameter of thequantization group corresponding to the previous position indecoding/decoding order may be used as a quantization parameter to beused for calculation of the predicted quantization parameter of thecurrent quantization group instead of the quantization parameter of theabsent neighboring quantization group. At this time, when a certainneighboring quantization group exists, the quantization parametertransmitted in a high-level syntax element may be used as a predictedquantization parameter. The high-level syntax element may be at leastone of a picture, a subpicture, a slice, a tile, a tile group, a tile, aCTU line, a CTU row, a CTU column, and a CTU.

Here, the expression that a neighboring quantization group does notexist means that the current quantization group is positioned at aboundary of at least one of a picture, a subpicture, a slice, a tile, atile group, a CTU line, a CTU row, a CTU column, and a CTU.

Here, the expression that a neighboring quantization group does notexist means that the neighboring quantization group is positionedoutside the boundary of at least one of a picture, a subpicture, aslice, a tile, a tile group, a CTU line, a CTU row, a CTU column, and aCTU.

Here, the expression that a neighboring quantization group does notexist means that the neighboring quantization group and the currentquantization group differ in terms of at least one of a picture, asubpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, and a CTU.

For example, when the current quantization group is the firstquantization group in at least one of a picture, a subpicture, a slice,a tile, a tile group, a tile, a CTU line, a CTU row, a CTU column, and aCTU, at least one of a picture-based quantization parameter, asubpicture-based quantization parameter, a slice-based quantizationparameter, a tile group-based quantization parameter, a tile-basedquantization parameter, and a CTU line-based quantization parameter maybe used as the predicted quantization parameter.

For example, when the current quantization group is the lastquantization group in at least one of a picture, a subpicture, a slice,a tile, a tile group, a tile, a CTU line, a CTU row, a CTU column, and aCTU, at least one of a picture-based quantization parameter, asubpicture-based quantization parameter, a slice-based quantizationparameter, a tile group-based quantization parameter, a tile-basedquantization parameter, and a CTU line-based quantization parameter maybe used as the predicted quantization parameter.

For example, when the current quantization group is the firstquantization group in at least one of a picture, a subpicture, a slice,a tile, a tile group, a tile, a CTU line, a CTU row, a CTU column, and aCTU, at least one of a picture-based quantization parameter, asubpicture-based quantization parameter, a slice-based quantizationparameter, a tile group-based quantization parameter, a tile-basedquantization parameter, and a CTU line-based quantization parameter maybe used as a quantization parameter used for calculation of thepredicted quantization parameter.

For example, when the current quantization group is the firstquantization group in the first CTU row, at least one of a quantizationparameter of a picture, a quantization parameter of a subpicture, aquantization parameter of a slice, a quantization parameter of a tilegroup, a quantization parameter of a tile, and a quantization parameterof a CTU line may be used as a quantization parameter used forcalculation of the predicted quantization parameter.

Alternatively, when the current quantization group is the firstquantization group in a CTU line, at least one of a quantizationparameter of a picture, a quantization parameter of a subpicture, aquantization parameter of a slice, a quantization parameter of a tilegroup, a quantization parameter of a tile, and a quantization parameterof a CTU line may be used as a quantization parameter used forcalculation of the predicted quantization parameter.

For example, when the current quantization group is the lastquantization group in at least one of a picture, a subpicture, a slice,a tile, a tile group, a tile, a CTU line, a CTU row, a CTU column, and aCTU, at least one of a quantization parameter of a picture, aquantization parameter of a subpicture, a quantization parameter of aslice, a quantization parameter of a tile group, a quantizationparameter of a tile, and a quantization parameter of a CTU line may beused as a quantization parameter used for calculation of the predictedquantization parameter.

Here, the term “quantization group” means a block or a region.

At the decoder, the quantization parameter may be determined by apredetermined rule.

According to one embodiment, for a current quantization group or atleast one block in a quantization group, at least one of thequantization parameter of a neighboring quantization group of thecurrent quantization group, the quantization parameter of the previousquantization group in encoding/decoding order, and the quantizationparameters signaled on a picture level, a subpicture level, a slicelevel, a tile group level, a tile level, a CTU line level, a CTU rowlevel, a CTU column level, and a CTU level may be used to derive thepredicted quantization parameter.

For example, the predicted quantization parameter of the currentquantization group may be derived from at least one of the quantizationparameters of the respective neighboring quantization groups of thecurrent quantization group. The process of deriving a predictedquantization parameter for a current quantization group will bedescribed with reference to FIGS. 10 through 13.

FIG. 10 is a diagram illustrating the process of deriving a predictedquantization parameter for a current quantization group, according toone embodiment of the present invention.

In FIG. 10, the unit size of a quantization group is demarcated by athick solid line. Sub-blocks resulting from division of a block aredemarcated by a thin solid line. A relatively bright solid linedemarcates the minimum size of a block that is encoded/decoded. Here,the minimum block size may be set to M×N where M or N is an integer. Forexample, the minimum block size for a luma component may be 4×4 and theminimum block size for a chroma component may be 2×2. The top leftposition in a quantization group A may be expressed as (x, y). Inaddition, curQGwidth and curQGheight represents the horizontal size(width) and the vertical size (height) of the current quantizationgroup.

In (a) of FIG. 10, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y).

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y).

The quantization parameters present at the positions B and C arerepresented as QP_B and QP_C, respectively.

At least one of the quantization parameters QP_B and QP_C or at leastone of the statistical values of the quantization parameters QP_B andQP_C may be used to derive the predicted quantization parameter for thecurrent quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 1.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 1} \right\rbrack\end{matrix}$

In (b) of FIG. 10, A represents a current quantization group. Each of B,C, D, and E represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B, C,D, and E.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y). The position D may be expressed as(x+(curQGwidth>>1), y−(1<<minBlklog2size)). The position E may beexpressed as (x−(1<<minBlklog2size), y+(curQGheight>>1))

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y). The position D may be expressed as(x+(curQGwidth>>1), y−1). The position E may be expressed as (x−1,y+(curQGheight>>1)).

The quantization parameters present at the positions B, C, D, and E areexpressed as QP_B, QP_C, QP_D, and QP_E, respectively.

At least one of the quantization parameters QP_B, QP_C, QP_D, and QP_Eor at least one of the statistical values of the quantization parametersQP_B, QP_C, QP_D, and QP_E may be used to derive the predictedquantization parameter for the current quantization group.

For example, the average of the QP_B, QP_C, QP_D, and QP_E may be usedto derive the predicted quantization parameter of the currentquantization group as represented by Expression 2.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 2} \right\rbrack\end{matrix}$

In (c) of FIG. 10, the A represents a current quantization group. Eachof B and C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as (x+(curQGwidth>>1),y−(curQGheight>>1)). The position C may be expressed as(x−(curQGwidth>>1), y+(curQGheight>>1)).

The quantization parameters present at the positions B and C arerepresented as QP_B and QP_C, respectively.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 3.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 3} \right\rbrack\end{matrix}$

In (d) of FIG. 10, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as(x+curQGwidth−(1<<minBlklog2size), y−(1(minBlklog2size)). The position Cmay be expressed as (x−(1(minBlklog2size),y+curQGheight-(1<<minBlklog2size)).

Alternatively, the position B may be expressed as (x+curQGwidth−1, y−1).The position C may be expressed as (x−1, y+curQGheight−1).

The quantization parameters present at the positions B and C arerepresented as QP_B and QP_C, respectively.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 4.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 4} \right\rbrack\end{matrix}$

FIG. 11 is a diagram illustrating a process of deriving a predictedquantization parameter for a current quantization group, according toanother embodiment of the present invention.

In FIG. 11, the unit size of a quantization group is demarcated by athick solid line. Sub-blocks resulting from division of a block aredemarcated by a thin solid line. A relatively bright solid linedemarcates the minimum size of a block that is encoded/decoded. Here,the minimum block size may be set to M×N where M or N is an integer. Forexample, the minimum block size for a luma component may be 4×4 and theminimum block size for a chroma component may be 2×2. The top leftposition in a quantization group A may be expressed as (x, y). Inaddition, curQGwidth and curQGheight represents the horizontal size(width) and the vertical size (height) of the current quantizationgroup. In addition, A represents the first quantization group in apredetermined CTU row. Alternatively, the A represents the firstquantization group in at least one CTU row included in a CTU line.

In (a) of FIG. 11, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y).

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y).

Here, the position B may be disposed outside the boundary of a picture,a subpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, or a CTU in which the current quantization group isdisposed.

For example, since the quantization group corresponding to the positionB is disposed outside the boundary, the quantization parameter of theposition B may not be used when deriving the predicted quantizationparameter. The quantization parameter of the position C may be expressedas QP_C.

By using the QP_C, the predicted quantization parameter of the currentquantization group may be derived.

For example, the QP_C may be used to derive the predicted quantizationparameter of the current quantization group as represented by Expression5.

$\begin{matrix}{{{predcur}\;{QP}} = {QP\_ C}} & \left\lbrack {{Expression}\mspace{14mu} 5} \right\rbrack\end{matrix}$

For example, since the quantization group corresponding to the positionB is disposed outside the boundary, the quantization parameter of theposition B may be replaced with the quantization parameter of theprevious quantization group in the encoding/decoding order or with thequantization parameter of a high-level and the replaced quantizationparameter may be used. The quantization parameter of the previousquantization group in encoding/decoding order or the quantizationparameter of a high-level may be expressed as QP_B. The quantizationparameter of the position C may be expressed as QP_C.

In the present embodiment and/or other embodiments of the presentinvention, the quantization parameter of the high-level may mean atleast one of a quantization parameter of a picture, a quantizationparameter of a subpicture, a quantization parameter of a slice, aquantization parameter of a tile group, a quantization parameter of atile, and a quantization parameter of a CTU line.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 6.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 6} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of the QP-B may be set to be smaller than theweighting factor of the QP_C.

In (b) of FIG. 11, A represents a current quantization group. Each of B,C, D, and E represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B, C,D, and E.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y). The position D may be expressed as(x+(curQGwidth>>1), y−(1<<minBlklog2size)). The position E may beexpressed as (x−(1(minBlklog2size), y+(curQGheight>>1)).

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y). The position D may be expressed as(x+(curQGwidth>>1), y−1). The position E may be expressed as (x−1,y+(curQGheight>>1)).

Here, at least one of the positions of B and D may be disposed outsidethe boundary of a picture, a subpicture, a slice, a tile, a tile group,a tile, a CTU line, a CTU row, a CTU column, or a CTU in which thecurrent quantization group is included.

For example, since the quantization group corresponding to at least oneof the positions of B and D is disposed outside the boundary, thequantization parameter at one or more positions B and D may not be usedwhen deriving the predicted quantization parameter. The quantizationparameters at the positions of C and E may be expressed as QP_C andQP_E, respectively.

At least one of the QP_C and QP_E or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_C and QP_E may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 7.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ C} + {QP\_ E} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 7} \right\rbrack\end{matrix}$

Alternatively, since the quantization group corresponding to theposition of at least one of B and D is disposed outside the boundary,the quantization parameter of the position of at least one of B and Dmay be replaced with the quantization parameter of the previousquantization group in encoding/decoding order or with the quantizationparameter of a high-level, and the replaced quantization parameter maybe used. The quantization parameter of the previous quantization groupin encoding/decoding order or the quantization parameter of thehigh-level may be expressed as QP_B and QP_D. The quantizationparameters at the positions of C and E may be expressed as QP_C andQP_E, respectively.

In this case, at least one of the QP_B, QP_C, QP_D, and QP_E or at leastone of the statistical values thereof may be used to derive thepredicted quantization parameter of the current quantization group.

For example, as in the example represented by Expression 8, the averageof QP_B, QP_C, QP_D, QP_E may be used to derive the predictedquantization parameter of the current quantization group.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 8} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,at least one of the weighting factors of the QP_B and QP_D may be set tobe smaller than at least one of the weighting factors of the QP_C andQP_E.

In (c) of FIG. 11, A represents a current quantization group. The A mayrepresent the first quantization group in a predetermined CTU row.Alternatively, the A may represent the first quantization group in atleast one CTU row included in a CTU line. Alternatively, the A mayrepresent at least one of the first quantization group in apredetermined slice, the first quantization group in a predeterminedsubpicture, the first quantization group in a predetermined tile group,and the first quantization group in a predetermined tile.

Each of B and C represents the position of a block or sample from whicha predicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y).

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y).

Here, the position C may be outside the boundary of a picture, asubpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, or a CTU in which the current quantization group isdisposed.

For example, since the quantization group corresponding to the positionof C is disposed outside the boundary, the quantization parameter of theposition of C may not be used for derivation of the predictedquantization parameter. The quantization parameter disposed at theposition of B may be expressed as QP_B.

By using the QP_B, the predicted quantization parameter of the currentquantization group may be derived.

For example, the QP_B may be used to derive the predicted quantizationparameter of the current quantization group as in the examplerepresented by Expression 9.

$\begin{matrix}{{{predcur}\;{QP}} = {QP\_ B}} & \left\lbrack {{Expression}\mspace{14mu} 9} \right\rbrack\end{matrix}$

For example, since the quantization group corresponding to the positionC is disposed outside the boundary, the quantization parameter of theposition C may be replaced with the quantization parameter of theprevious quantization group in the encoding/decoding order or with thequantization parameter of a high-level, and the replaced quantizationparameter may be used. The quantization parameter of the previousquantization group in encoding/decoding order or the quantizationparameter of a high-level may be expressed as QP_C. The quantizationparameter disposed at the position of B may be expressed as QP_B.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group as inthe example represented by Expression 10.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 10} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of the QP_B may be set to be smaller than theweighting factor of the QP_B.

In (d) of FIG. 11, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC.

For example, the position B may be expressed as(x+curQGwidth−(1<<minBlklog2size), y−(1<<minBlklog2size)). The positionC may be expressed as (x−(1(minBlklog2size),y+curQGheight−(1<<minBlklog2size)).

Alternatively, the position B may be expressed as (x+curQGwidth−1, y−1).The position C may be expressed as (x−1, y+curQGheight−1).

Here, the position C may be outside the boundary of a picture, asubpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, or a CTU in which the current quantization group isdisposed.

For example, since the quantization group corresponding to the positionC is disposed outside the boundary, the quantization parameter of theposition C may not be used for derivation of the predicted quantizationparameter. The quantization parameter disposed at the position B may beexpressed as QP_B.

By using the QP_B, the predicted quantization parameter of the currentquantization group may be derived.

For example, the QP_B may be used to derive the predicted quantizationparameter of the current quantization group as represented by Expression11.

$\begin{matrix}{{{predcur}\;{QP}} = {QP\_ B}} & \left\lbrack {{Expression}\mspace{14mu} 11} \right\rbrack\end{matrix}$

For example, since the quantization group corresponding to the positionC is disposed outside the boundary, the quantization parameter of theposition C may be replaced with the quantization parameter of theprevious quantization group in the encoding/decoding order or with thequantization parameter of a high-level, and the replaced quantizationparameter may be used. The quantization parameter of the previousquantization group in encoding/decoding order or the quantizationparameter of a high-level may be expressed as QP_C. The quantizationparameter at the position of the B may be expressed as QP_B.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 12.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 12} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of the QP_C may be set to be smaller than theweighting factor of the QP_B.

FIG. 12 is a diagram illustrating a process of deriving a predictedquantization parameter for a current quantization group, according to afurther embodiment of the present invention.

In FIG. 12, the unit size of a quantization group is demarcated by athick solid line. Sub-blocks resulting from division of a block aredemarcated by a thin solid line. A relatively bright solid linedemarcates the minimum size of a block to be encoded/decoded. Here, theminimum block size may be set to M×N where M or N is an integer. Forexample, the minimum block size for a luma component may be 4×4 and theminimum block size for a chroma component may be 2×2. The top leftposition in a quantization group A may be expressed as (x, y). Inaddition, curQGwidth and curQGheight represents the horizontal size(width) and the vertical size (height) of the current quantizationgroup, respectively.

In (a) of FIG. 12, A represents a current quantization group. Each of B,C, D, and E represents the position a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. In this case, a quantization parameter of a quantization groupcorresponding to at least one of the positions of B, C, D, and E may beused to derive a predicted quantization parameter for a currentquantization group. The current quantization group A may have anon-square shape. A method of deriving a quantization parameter for anon-square quantization group may be similar to the method of deriving aquantization parameter for a square quantization group.

For example, the position B may be expressed as (x,y−(1<<minBlklog2size)). The position C may be expressed as(x−(1<<minBlklog2size), y). The position D may be expressed as(x+(curQGwidth>>1), y−(1<<minBlklog2size)). The position E may beexpressed as (x−(1(minBlklog2size), y+(curQGheight>>1)).

Alternatively, the position B may be expressed as (x, y−1). The positionC may be expressed as (x−1, y). The position D may be expressed as(x+(curQGwidth>>1), y−1). The position E may be expressed as (x−1,y+(curQGheight>>1)).

The quantization parameters present at the positions B, C, D, and E areexpressed as QP_B, QP_C, QP_D, and QP_E, respectively.

At least one of the QP_B, QP_C, QP_D, and QP_E or at least one of thestatistical values thereof may be used to derive the predictedquantization parameter of the current quantization group.

For example, as represented by Expression 13, the average of the QP_B,QP_C, QP_D, and QP_E may be used to derive the predicted quantizationparameter of the current quantization group.

$\begin{matrix}{{{predcur}\;{QP}} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 13} \right\rbrack\end{matrix}$

In (b) of FIG. 12, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the positions B andC. The current quantization group A may have a non-square shape. Amethod of deriving a quantization parameter for a non-squarequantization group may be similar to the method of deriving aquantization parameter for a square quantization group. Alternatively, apredicted quantization parameter for a non-square quantization group maybe derived on the basis of the width and/or the height of the non-squarequantization group.

For example, the position B may be expressed as (x+(BQGwidth>>1),y−(BQGheight>>1)). The position C may be expressed as (x−(CQGwidth>>1),y+(CQGheight>>1)). Here, XQGwidth and XQGheight may represent the widthand height of a neighboring quantization group disposed around thecurrent quantization group, respectively. For example, the width andheight of the quantization group at the position B may be expressed byreplacing the character “X” with the character “B”, for example,BQGwidth and BQGheight, respectively. The width and height of thequantization group at the position C may be expressed by replacing thecharacter “X” with the character “C”, for example, CQGwidth andCQGheight, respectively.

The quantization parameters present at the positions B and C areexpressed as QP_B and QP_C, respectively.

At least one of the QP_B and QP_C or at least one of the statisticalvalues thereof may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the average of the QP_B and QP_C may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 14.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 14} \right\rbrack\end{matrix}$

In (c) of FIG. 12, A represents a current quantization group. Each of B,C, D, E, and F represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. The predicted quantization parameter of the current quantizationgroup may be derived by using the quantization parameter of thequantization group corresponding to at least one of the B, C, D, E, andF.

For example, the position B may be expressed as (x−(1<<minBlklog2size),y+curQGheight−(1<<minBlklog2size)). The position of the C may beexpressed as (x+curQGwidth-(1<<minBlklog2size), y−(1(minBlklog2size)).The position D may be expressed as (x+curQGwidth,y−(1<<minBlklog2size)). The position E may be expressed as(x−(1(minBlklog2size), y+curQGheight). The position F may be expressedas (x−(1(minBlklog2size), y−(1(minBlklog2size)).

Alternatively, the position B may be expressed as (x−1,y+curQGheight−1). The position C may be expressed as (x+curQGwidth−1,y−1). The position D may be expressed as (x+curQGwidth, y−1). Theposition E may be expressed as (x−1, y+curQGheight). The position F maybe expressed as (x−1, y−1).

The quantization parameters present at the positions B, C, D, E, and Fmay be expressed as QP_B, QP_C, QP_D, QP_E, and QP_F, respectively.

At least N quantization parameters of the QP_B, QP_C, QP_D, QP_E, andQP_F or a statistical value of at least N quantization parameters of theQP_B, QP_C, QP_D, QP_E, and QP_F may be used to derive the predictedquantization parameter of the current quantization group. Here, N is apositive integer.

The N quantization parameters may be selected according to a specificorder. The specific order may be the encoding/decoding order or theorder of specific positions that are processed in the encoder/decoder.The specific order may mean the order of B, C, D, E, and F.

For example, a statistical value (for example, the average) of twoquantization parameters QP_B and QP_C among the quantization parametersQP_B, QP_C, QP_D, and QP_E, QP_F may be used to derive the predictedquantization parameter of the current quantization group as representedby Expression 15.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 15} \right\rbrack\end{matrix}$

In (d) of FIG. 12, A represents a current quantization group. Each of Band C represents the position of a block or sample from which apredicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. Here, when the current quantization group is a quantization grouppositioned at the top left corner or the first quantization group in atleast one of a picture, a subpicture, a slice, a tile group, a tile, aCTU line, a CTU row, and a CTU column, there may not be quantizationgroups at the positions B and C. In this case, the predictedquantization parameter of the current quantization group may be a valuetransmitted from the high-level syntax element. Here, the valuetransmitted from the high-level syntax element may mean at least one ofthe high-level quantization parameters.

The high-level syntax element may be at least one of a picture, asubpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, and a CTU.

For example, when the value of the transmitted quantization parameter ina picture is picQP, the predicted quantization parameter of the currentquantization group may be derived as in the example of Expression 16.

$\begin{matrix}{{predcurQP} = {PicQP}} & \left\lbrack {{Expression}\mspace{14mu} 16} \right\rbrack\end{matrix}$

Alternatively, when the value of the transmitted quantization parameterin a slice is sliceQP, the predicted quantization parameter of thecurrent quantization group may be derived as in the example ofExpression 17.

$\begin{matrix}{{predcurQP} = {{slice}\mspace{11mu}{QP}}} & \left\lbrack {{Expression}\mspace{14mu} 17} \right\rbrack\end{matrix}$

Further alternatively, when the value of the transmitted quantizationparameter in a tile group is tilegroupQP, the predicted quantizationparameter of the current quantization group may be derived as in theexample of Expression 18.

$\begin{matrix}{{{predcur}\;{QP}} = {{tilegroup}\;{QP}}} & \left\lbrack {{Expression}\mspace{14mu} 18} \right\rbrack\end{matrix}$

Further alternatively, when the value of the transmitted quantizationparameter in a tile is tileQP, the predicted quantization parameter ofthe current quantization group may be derived as in the example ofExpression 19.

$\begin{matrix}{{predcurQP} = {{tile}\mspace{11mu}{QP}}} & \left\lbrack {{Expression}\mspace{14mu} 19} \right\rbrack\end{matrix}$

FIG. 13 is a diagram illustrating a process of deriving a predictedquantization parameter of a current quantization group, according to afurther embodiment of the present invention.

In FIG. 13, the unit size of a quantization group is demarcated by athick solid line. Sub-blocks resulting from division of a block aredemarcated by a thin solid line. A relatively bright solid linedemarcates the minimum size of a block that is encoded/decoded. Here,the minimum block size may be set to M×N where M or N is an integer. Forexample, the minimum block size for a luma component may be 4×4 and theminimum block size for a chroma component may be 2×2. The top leftposition in a quantization group A may be expressed as (x, y). Inaddition, curQGwidth and curQGheight represent the horizontal size(width) and the vertical size (height) of the current quantizationgroup, respectively.

In (a) of FIG. 13, A represents a current quantization group. At leastone of B, C, D, E, and F represents the position of a block or samplefrom which a predictive quantization parameter is derived or mayrepresent the position of a neighboring quantization group disposedaround the current quantization group. Here, the quantization parameterof the quantization group corresponding to at least one of the positionsB, C, D, E, and F may be used to derive the predictive quantizationparameter of the current quantization group.

For example, the position B may be expressed as (x−(1<<minBlklog2size),y+curQGheight−(1<<minBlklog2size)). The position of the C may beexpressed as (x+curQGwidth-(1<<minBlklog2size), y−(1(minBlklog2size)).The position D may be expressed as (x+curQGwidth,y−(1<<minBlklog2size)). The position E may be expressed as(x−(1(minBlklog2size), y+curQGheight). The position F may be expressedas (x−(1<<minBlklog2size), y−(1(minBlklog2size)).

Alternatively, the position B may be expressed as (x−1,y+curQGheight−1). The position C may be expressed as (x+curQGwidth−1,y−1). The position D may be expressed as (x+curQGwidth, y−1). Theposition E may be expressed as (x−1, y+curQGheight). The position F maybe expressed as (x−1, y−1).

At least one position among the positions B, E, and F may be outside theboundary of at least one of a current picture, a subpicture, a slice, atile group, a tile, a CTU line, a CTU row, a CTU column, and a CTU.

Since a quantization group corresponding to at least one of thepositions B, E, and F is outside the boundary, a quantization parameterat one or more positions B, E, and F is not used for derivation of thepredicted quantization parameter of the current quantization group. Onthe other hand, the quantization parameters at the positions C and D maybe expressed as QP_C and QP_D, respectively.

The predictive quantization parameter of the current quantization groupmay be derived using at least one of the QP_C and QP_D or at least onestatistical value of the QP_C and QP_D.

For example, as in the example of Expression 20, the predictedquantization parameter of the current quantization group may be derivedusing the average of the QP_C and QP_D.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ C} + {QP\_ D} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 20} \right\rbrack\end{matrix}$

As another example, since the quantization group corresponding to atleast one of the positions B, E, and F is outside the boundary, thequantization parameter corresponding to at least one of the positions B,E, and F may be replaced with the quantization parameter of the previousquantization group in encoding/decoding order or with the quantizationparameter of a high-level. At this time, the quantization parameter ofthe previous quantization group in encoding/decoding or the quantizationparameter of the higher level may be expressed as QP_B, QP_E, and QP_F.In addition, the quantization parameters at the positions C and D may beexpressed as QP_C and QP_D, respectively.

On the other hand, it is possible to derive the predicted quantizationparameter of the current quantization group using at least Nquantization parameters or a statistical value of the at least Nquantization parameters among the QP_B, QP_C, QP_D, QP_E and QP_F. Here,N is a positive integer.

The N quantization parameters may be selected according to a specificorder. The specific order is the encoding/decoding order or the order ofspecific positions that are processed in the encoder/decoder. Thespecific order may mean the order of B, C, D, E, and F.

For example, the predictive quantization parameter of the currentquantization group may be derived using a statistical value (forexample, the average) of two quantization parameters QP_B and QP_C amongthe QP_B, QP_C, QP_D, QP_E and QP_F as represented by Expression 21.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 21} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of at least one of the QP_B, QP_E, and QP_F may beset to be smaller than the weighting factor of at least one of the QP_Cand QP_D.

In (b) of FIG. 13, A represents a current quantization group. At leastone of B, C, D, E, and F may represent the position of a block or samplefrom which a predictive quantization parameter is derived or mayrepresent the position of a neighboring quantization group disposedaround the current quantization group. Here, the quantization parameterof the quantization group corresponding to at least one of the positionsB, C, D, E, and F may be used to derive the predicted quantizationparameter of the current quantization group.

For example, the position B may be expressed as (x−(1<<minBlklog2size),y+curQGheight−(1<<minBlklog2size)). The position C may be expressed as(x+curQGwidth−(1<<minBlklog2size), y−(1<<minBlklog2size)). The positionD may be expressed as (x+curQGwidth, y−(1<<minBlklog2size)). Theposition E may be expressed as (x−(1<<minBlklog2size), y+curQGheight).The position F may be expressed as (x−(1(minBlklog2size),y−(1<<minBlklog2size)).

Alternatively, the position B may be expressed as (x−1,y+curQGheight−1). The position C may be expressed as (x+curQGwidth−1,y−1). The position D may be expressed as (x+curQGwidth, y−1). Theposition E may be expressed as (x−1, y+curQGheight). The position F maybe expressed as (x−1, y−1).

At least one position among the positions C, D, and F may be outside theboundary of at least one of a current picture, a subpicture, a slice, atile group, a tile, a CTU line, a CTU row, a CTU column, and a CTU.

For example, since a quantization group corresponding to at least one ofthe positions C, D, and F is outside the boundary, a quantizationparameter of at least one of the positions C, D, and F may not be usedfor derivation of the predicted quantization parameter of the currentquantization group. The quantization parameters at the positions B and Emay be expressed as QP_B and QP_E, respectively.

At least one of the QP_B and QP_C or at least one of the statisticalvalues of the QP_B and QP_C may be used to derive the predictedquantization parameter of the current quantization group.

For example, the average of the QP_C and QP_E may be used to derive thepredicted quantization parameter of the current quantization group asrepresented by Expression 22.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ E} + 1} \right) ⪢ 1}} & \left\lbrack {{Expression}\mspace{14mu} 22} \right\rbrack\end{matrix}$

As another example, since the quantization group corresponding to atleast one of the positions C, D, and F is outside the boundary, thequantization parameter corresponding to at least one of the positions C,D, and F may be replaced with the quantization parameter of the previousquantization group in encoding/decoding order or with the quantizationparameter of a high-level. At this time, the quantization parameter ofthe previous quantization group in encoding/decoding or the quantizationparameter of the higher level may be expressed as QP_C, QP_D, and QP_F.The quantization parameters at the positions B and E may be expressed asQP_B and QP_E, respectively.

On the other hand, it is possible to derive the predicted quantizationparameter of the current quantization group using at least Nquantization parameters or a statistical value of the at least Nquantization parameters among the QP_B, QP_C, QP_D, QP_E and QP_F. Here,N is a positive integer.

The N quantization parameters may be selected according to a specificorder. The specific order may be the encoding/decoding order or theorder of specific positions that are processed in the encoder/decoder.The specific order may mean the order of B, C, D, E, and F.

For example, the predictive quantization parameter of the currentquantization group may be derived using a statistical value (forexample, the average) of four quantization parameters QP_B, QP_C, QP_D,and QP_E among the QP_B, QP_C, QP_D, QP_E and QP_F as represented byExpression 23.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 23} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of at least one of the QP_C, QP_D, and QP_F may beset to be smaller than the weighting factor of at least one of the QP_Band QP_E.

In (c) of FIG. 13, A represents a current quantization group. Each of B,C, D, E, and F may represent the position of a block or sample fromwhich a predicted quantization parameter is derived or the position of aneighboring quantization group disposed around the current quantizationgroup. Here, the quantization parameter of the quantization groupcorresponding to at least one of the positions B, C, D, E, and F may beused to derive the predicted quantization parameter of the currentquantization group. The current quantization group A may have anon-square shape. A method of deriving a quantization parameter for anon-square quantization group may be similar to the method of deriving aquantization parameter for a square quantization group.

For example, the position B may be expressed as (x−(1<<minBlklog2size),y+curQGheight−(1<<minBlklog2size)). The position C may be expressed as(x+curQGwidth−(1<<minBlklog2size), y−(1<<minBlklog2size)). The positionD may be expressed as (x+curQGwidth, y−(1<<minBlklog2size)). Theposition E may be expressed as (x−(1<<minBlklog2size), y+curQGheight).The position F may be expressed as (x−(1(minBlklog2size),y−(1<<minBlklog2size)).

Alternatively, the position B may be expressed as (x−1,y+curQGheight−1). The position C may be expressed as (x+curQGwidth−1,y−1). The position D may be expressed as (x+curQGwidth, y−1). Theposition E may be expressed as (x−1, y+curQGheight). The position F maybe expressed as (x−1, y−1).

Here, the position E may be outside the boundary of a picture, asubpicture, a slice, a tile, a tile group, a tile, a CTU line, a CTUrow, a CTU column, or a CTU in which the current quantization group isdisposed.

For example, since the quantization group corresponding to the positionE is disposed outside the boundary, the quantization parameter of theposition E may not be used for derivation of the predicted quantizationparameter. The quantization parameters present at the positions B, C, D,and F are expressed as QP_B, QP_C, QP_D, and QP_F, respectively.

At least one of the QP_B, QP_C, QP_D, and QP_F or at least one of thestatistical values of the QP_B, QP_C, QP_D, and QP_F may be used toderive the predicted quantization parameter of the current quantizationgroup.

For example, the average of the QP_B, QP_C, QP_D, and QP_F may be usedto derive the predicted quantization parameter of the currentquantization group as represented by Expression 24.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 24} \right\rbrack\end{matrix}$

For example, since the quantization group corresponding to the positionE is disposed outside the boundary, the quantization parameter of theposition E may be replaced with the quantization parameter of theprevious quantization group in the encoding/decoding order or with thequantization parameter of a high-level, and the replaced quantizationparameter may be used. The quantization parameter of the previousquantization group in encoding/decoding order or the quantizationparameter of a high-level may be expressed as QP_E. The quantizationparameters present at the positions B, C, D, and F are expressed asQP_B, QP_C, QP_D, and QP_F, respectively.

On the other hand, it is possible to derive the predicted quantizationparameter of the current quantization group using at least Nquantization parameters or a statistical value of the at least Nquantization parameters among the QP_B, QP_C, QP_D, QP_E and QP_F. Here,N is a positive integer.

The N quantization parameters may be selected according to a specificorder. The specific order may be the encoding/decoding order or theorder of specific positions that are processed in the encoder/decoder.The specific order may mean the order of B, C, D, E, and F.

For example, the predictive quantization parameter of the currentquantization group may be derived using a statistical value (forexample, the average) of four quantization parameters QP_B, QP_C, QP_D,and QP_E among the QP_B, QP_C, QP_D, QP_E and QP_F as represented byExpression 25.

$\begin{matrix}{{predcurQP} = {\left( {{QP\_ B} + {QP\_ C} + {QP\_ D} + {QP\_ E} + 2} \right) ⪢ 2}} & \left\lbrack {{Expression}\mspace{14mu} 25} \right\rbrack\end{matrix}$

Alternatively, a weighted average may be used to derive the predictedquantization parameter of the current quantization group. In this case,the weighting factor of the QP_E may be set to be smaller than at leastone of the weighting factors of the QP_B, QP_C, QP_D, and QP_F.

Hereinafter, the step of encoding/decoding the size information of aquantization group and/or the information of a delta quantizationparameter will be described below.

The size information of the quantization group may be entropy-coded inthe encoder. Here, the size information of a quantization group may beentropy-coded into a bitstream on a level of a video parameter set(VPS), a sequence parameter set (SPS), an adaptation parameter set(APS), a picture parameter set (PPS), a subpicture header, a sliceheader, a tile group header, a CTU line, a CTU row, a CTU column, a CTU,or a block.

For example, the size of each unit or block for which a deltaquantization parameter is signaled may be entropy-coded using at leastone of depth, length, area, ratio, shape, and subdivision specifying thesize of a quantization group as shown in Table 2. Table 2 shows anexample of the size of each unit or block for which a delta quantizationparameter that is determined from quantization group size determinationinformation is signaled. Here, the size of each unit or block for whichthe delta quantization parameter is signaled may mean the sizeinformation of a quantization group.

As another example, the size information of the quantization group maybe entropy-coded using at least one of the ratio and the shapespecifying the size of the quantization group.

The size information of the quantization group may be entropy-coded inthe encoder. Here, the size information of the quantization group may beentropy-decoded from a bitstream on a level of a video parameter set(VPS), a sequence parameter set (SPS), an adaptation parameter set(APS), a picture parameter set (PPS), a subpicture header, a sliceheader, a tile group header, a CTU line, a CTU row, a CTU column, a CTU,or a block.

For example, the size of each unit or block for which a deltaquantization parameter is signaled may be entropy-decoded using at leastone of depth, length, area, ratio, shape, and subdivision specifying thesize of a quantization group as shown in Table 2. Here, the size of eachunit or block for which the delta quantization parameter is signaled maymean the size information of a quantization group.

As another example, the size information of the quantization group maybe entropy-decoded using at least one of the ratio and the shapespecifying the size of the quantization group.

TABLE 2 information a basic unit for used to which size determineinformation of size of quantization quantization group is example ofgroup signaled syntax element meaning depth video parameterdiff_cu_qp_depth This may mean a set (VPS), difference value sequencebetween depth of CTU parameter set and depth of (SPS), adaptionquantization group. parameter set Here, depth of CTU (APS), picture maymean 0. parameter set Depth of quantization (PPS), group may mean a unitsubpicture depth on a basis of header, slice which delta header, tilequantization parameter group header, is signaled. length CTU line, CTUlog2_diff_cu_qp_ This may mean a row, CTU delta-length difference valuecolumn, CTU, between length of CTU block and horizontal Or verticallength of quantization group. Here, length may mean horizontal orvertical length of CTU or horizontal or vertical length of quantizationgroup. Length of quantization group may mean a unit length on a basis ofwhich delta quantization parameter is signaled. area log4_diff_cu_qp_This may mean a delta_area/diff_ difference value cu_qp_delta_areabetween area of CTU and area of quantization group. In addition, area ofquantization group may mean a unit area on a basis of which deltaquantization parameter is signaled. subdivision cu_qp_delta_ This maymean a subdiv difference value between depth of CTU and subdivision ofquantization group. Here, depth of CTU may be 0. Subdivision ofquantization group may mean a unit area on a basis of which deltaquantization parameter is signaled.

The delta quantization parameter information may be entropy-coded in theencoder. At least one entry of the delta quantization parameterinformation may be entropy-encoded on at least one basis among aquantization group basis, a CU basis, a PU basis, a TU basis, and ablock basis.

The delta quantization parameter information may be entropy-decoded inthe decoder. At least one entry of the delta quantization parameterinformation may be entropy-decoded on at least one basis among aquantization group basis, a CU basis, a PU basis, a TU basis, and ablock basis.

At least one delta quantization parameter may be entropy-coded/decodedfor each quantization group.

At least one delta quantization parameter may beentropy-coded/entropy-decoded for each quantization group by settingwhether the delta quantization parameter isentropy-coded/entropy-decoded in a quantization group using a variableor flag such as IsCuDeltaQPCoded. That is, when a delta quantizationparameter is entropy-coded/entropy-decoded in a quantization group, theflag or value IsCuDeltaQPCoded is set to a first value. Here, the firstvalue may be 1. At least one delta quantization parameter may beentropy-coded/entropy-decoded for each quantization group depending onthe shape of a corresponding one of the quantization groups.

For example, when a CTU has a size of 64×64 and diff_cu_qp_delta_depthis 1, in a case where a current block has a block depth of 1 (i.e., thedepth of a quadtree is 1 and the size is 32×32), a delta quantizationparameter of the current block may be entropy-coded/entropy-encoded.That is, after the delta quantization parameter of the current block isentropy-coded/entropy-decoded, the flag or value IsCuDeltaQPCoded may beset to a first value. When the diff_cu_qp_delta_depth is 1, the size ofa quantization group may be set to 32×32.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 1, in a case where a current block has a blockdepth of 2 (i.e., the depth of a quadtree depth is 1 and a block size is16×16), the delta quantization parameter may beentropy-coded/entropy-encoded for the first block among the blocksresulting from division at the depth of 1 which is the same as the depthinformation of the quantization group. The variable or flagIsCuDeltaQPCoded may be set to a first value after the deltaquantization parameter for the current block isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks in onequantization group can share the same delta quantization parameter.Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also can beshared by the blocks in one quantization group. When thediff_cu_qp_delta_depth is 1, the size of a quantization group may be setto 32×32. In addition, the other blocks in the quantization group maydetermine their delta quantization parameter on the basis of the deltaquantization parameter. In addition, the other blocks in thequantization group may determine their delta quantization parameter onthe basis of the delta quantization parameter.

For example, when a CTU has a size of 128×128 and diff_cu_qp_delta_depthis 1, in a case where a current block has a block depth of 3 (i.e., thedepth of a quadtree is 2, the depth of a binary tree is 1, and the sizeis 32×16), a delta quantization parameter of the current block may beentropy-coded/entropy-encoded. After the delta quantization parameter ofthe current block is entropy-coded/entropy-decoded, the flag or valueIsCuDeltaQPCoded may be set to a first value. In this case, the size ofthe quantization group may be set to the size of the current block.

For example, when a CTU has a size of 64×64 and diff_cu_qp_delta_depthis 3, in a case where a current block has a block depth of 2 (i.e., thedepth of a quadtree is 1, the depth of a binary tree is 1, and the sizeis 32×16), a delta quantization parameter of the current block may beentropy-coded/entropy-encoded. After the delta quantization parameter ofthe current block is entropy-coded/entropy-decoded, the flag or valueIsCuDeltaQPCoded may be set to a first value. In this case, the size ofthe quantization group may be set to the size of the current block.

For example, when a CTU has a size of 64×64 and diff_cu_qp_delta_depthis 3, in a case where a current block has a block depth of 2 (i.e., thedepth of a quadtree is 1, the depth of a multi-type tree is 1, and theblock size is 32×16), a delta quantization parameter of the currentblock may be entropy-coded/entropy-encoded. After the delta quantizationparameter of the current block is entropy-coded/entropy-decoded, theflag or value IsCuDeltaQPCoded may be set to a first value. In thiscase, the size of the quantization group may be set to the size of thecurrent block.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 2, in a case where a current block has a blockdepth of 3 (i.e., the depth of a quadtree depth is 1, the depth of abinary tree is 1, the depth of a ternary tree 3, and the block size is8×16), the delta quantization parameter may beentropy-coded/entropy-encoded for the first block among the blocksresulting from division at the depth of 2 which is the same as the depthinformation of the quantization group. The variable or flagIsCuDeltaQPCoded may be set to a first value after the deltaquantization parameter for the current block isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks having adepth the same as or greater than the depth information of thequantization group can share the delta quantization parameter. Since theblocks in one quantization group use the same predicted quantizationparameter, the same quantization parameter also can be shared by theblocks in one quantization group. The size of the quantization group maybe set on the basis of the quantization group depth informationdiff_cu_qp_delta_depth.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 2, in a case where a current block has a blockdepth of 3 (i.e., the depth of a quadtree depth is 1, the depth of amulti-type tree is 2, and the block size is 8×16), the deltaquantization parameter may be entropy-coded/entropy-encoded for thefirst block among the blocks resulting from division at the depth of 1which is the same as the depth information of the quantization group.The variable or flag IsCuDeltaQPCoded may be set to a first value afterthe delta quantization parameter for the current block isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks having adepth the same as or greater than the depth information of thequantization group can share the delta quantization parameter. Since theblocks in one quantization group use the same predicted quantizationparameter, the same quantization parameter also can be shared by theblocks in one quantization group. The size of the quantization group maybe set on the basis of the quantization group depth informationdiff_cu_qp_delta_depth.

Further alternatively, for example, when a CTU has a size of 32×32 andlog2_diff_cu_qp_delta_length (quantization group length information) is1, the size of a quantization group may be set to 16×16. When the sizeof a current block is 4×12, a delta quantization parameter for the firstblock in the quantization group may be entropy-coded/entropy-decoded.The variable or flag IsCuDeltaQPCoded may be set to a first value afterthe delta quantization parameter is entropy-coded/entropy-decoded sothat it is not necessary to entropy-code/entropy-decode the deltaquantization parameters for the other blocks in the quantization group.Therefore, the blocks in one quantization group can share the same deltaquantization parameter. Since the blocks in one quantization group usethe same predicted quantization parameter, the same quantizationparameter also can be shared by the blocks in one quantization group. Inaddition, the other blocks in the quantization group may determine theirdelta quantization parameter on the basis of the delta quantizationparameter. In addition, the other blocks in the quantization group maydetermine their delta quantization parameter on the basis of the deltaquantization parameter.

Further alternatively, for example, when a CTU has a size of 128×128 andthe log2_diff_cu_qp_delta_length (quantization group length information)is 2, the size of a quantization group may be set to 32×32. When thesize of a current block is 16×8, a delta quantization parameter for thefirst block in the quantization group may beentropy-coded/entropy-decoded. The variable or flag IsCuDeltaQPCoded maybe set to a first value after the delta quantization parameter isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks in onequantization group can share the same delta quantization parameter.Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also can beshared by the blocks in one quantization group. In addition, the otherblocks in the quantization group may determine their delta quantizationparameter on the basis of the delta quantization parameter. In addition,the other blocks in the quantization group may determine their deltaquantization parameter on the basis of the delta quantization parameter.

Further alternatively, for example, when a CTU has a size of 32×32 andthe log2_diff_cu_qp_delta_length (quantization group length information)is 1, the size of a quantization group may be set to 16×16. When thesize of a current block is 16×8, a delta quantization parameter for thefirst block in the quantization group may beentropy-coded/entropy-decoded. The variable or flag IsCuDeltaQPCoded maybe set to a first value after the delta quantization parameter isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks in onequantization group can share the same delta quantization parameter.Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also can beshared by the blocks in one quantization group. In addition, the otherblocks in the quantization group may determine their delta quantizationparameter on the basis of the delta quantization parameter. In addition,the other blocks in the quantization group may determine their deltaquantization parameter on the basis of the delta quantization parameter.

Further alternatively, for example, when a CTU has a size of 64×64 andthe log2_diff_cu_qp_delta_length (quantization group length information)is 2, the size of a quantization group may be set to 16×16. When thesize of a current block is 32×16, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. When the maximumlength (maximum value) of the horizontal length (width) and the verticallength (height) of the current block is longer than the length of thequantization group, the size of the quantization group may be set to thesize of the current block. Since the maximum length (maximum value) ofthe horizontal length (width) and the vertical length (height) of thecurrent block is longer than the length of the quantization group, thedelta quantization parameter for the current block isentropy-coded/entropy-decoded after the IsCuDeltaQPCoded is set to afirst value. When the size of the quantization group is within a sizerange of the current block, the size of the quantization group may beset to the size of the current block.

Further alternatively, for example, when a CTU has a size of 256×256 andthe log2_diff_cu_qp_delta_length (quantization group length information)is 2, the size of a quantization group may be set to 32×32. When thesize of a current block is 64×16, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. When the maximumlength (maximum value) of the horizontal length (width) and the verticallength (height) of the current block is longer than the length of thequantization group, the size of the quantization group may be set to thesize of the current block. Since the maximum length of the horizontallength (width) and the vertical length (height) of the current block islonger than the length of the quantization group, the delta quantizationparameter for the current block may be entropy-coded/entropy-decodedafter the IsCuDeltaQPCoded is set to a first value.

Further alternatively, for example, when a CTU has a size of 32×32 andthe log2_diff_cu_qp_delta_length (quantization group length information)is 2, the size of a quantization group may be set to 8×8. When the sizeof a current block is 4×16, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. When the maximumlength of the horizontal length (width) and the vertical length (height)of the current block is longer than the length of the quantizationgroup, the size of the quantization group may be set to the size of thecurrent block. Since the maximum length of the horizontal length (width)and the vertical length (height) of the current block is longer than thelength of the quantization group, the delta quantization parameter forthe current block may be entropy-coded/entropy-decoded after theIsCuDeltaQPCoded is set to a first value.

Further alternatively, for example, when a CTU has a size of 32×32 andthe log4_diff_cu_qp_delta_area (quantization group area information) is1, the size of a quantization group may be set to 16×16. When the sizeof a current block is 16×16, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded.

Further alternatively, for example, when a CTU has a size of 128×128 andthe log4_diff_cu_qp_delta_area (quantization group area information) is2, the size of a quantization group may be set to 32×32. When the sizeof a current block is 16×16, a delta quantization parameter for thefirst block in the quantization group may beentropy-coded/entropy-decoded. The variable or flag IsCuDeltaQPCoded maybe set to a first value after the delta quantization parameter isentropy-coded/entropy-decoded so that it is not necessary toentropy-code/entropy-decode the delta quantization parameters for theother blocks in the quantization group. Therefore, the blocks in onequantization group can share the same delta quantization parameter.Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also can beshared by the blocks in one quantization group. In addition, the otherblocks in the quantization group may determine their delta quantizationparameter on the basis of the delta quantization parameter. In addition,the other blocks in the quantization group may determine their deltaquantization parameter on the basis of the delta quantization parameter.

Further alternatively, for example, when a CTU has a size of 64×64 andthe log4_diff_cu_qp_delta_area (quantization group area information) is2, the size of a quantization group may be set to 16×16. When the sizeof a current block is 32×16, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. When the area of thecurrent block is larger than the area of the quantization group, thesize of the quantization group is set to the size of the current block.Since the maximum length of the horizontal length (width) and thevertical length (height) of the current block is longer than the lengthof the quantization group, the delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded after theIsCuDeltaQPCoded is set to a first value.

Here, the first block may mean the first block among blocks of which thecoding block flag is not the first value. Here, the first value may be0.

In this case, the size of the quantization group may be set to the sizeof the current block.

Further alternatively, for example, when a CTU has a size of 64×64 andthe log4_diff_cu_qp_delta_area (quantization group area information) is2, the size of a quantization group may be set to 16×16. When the sizeof a current block is 16×32, a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. When the area of thecurrent block is larger than the area of the quantization group, thesize of the quantization group is set to the size of the current block.Since the maximum length of the horizontal length (width) and thevertical length (height) of the current block is longer than the lengthof the quantization group, the delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded after theIsCuDeltaQPCoded is set to a first value.

Further alternatively, for example, when a CTU has a size of 32×32 andratio information specifying the size of a quantization group is 2, thesize of the quantization group may be set to 16×16. When the size of acurrent block is 4×12, a delta quantization parameter for the firstblock in the quantization group may be entropy-coded/entropy-decoded.The variable or flag IsCuDeltaQPCoded may be set to the first valueafter the delta quantization parameter is entropy-coded/entropy-decodedso that it is not necessary to entropy-code/entropy-decode the deltaquantization parameters for the other blocks in the quantization group.Therefore, the blocks in one quantization group can share the same deltaquantization parameter. Since the blocks in one quantization group usethe same predicted quantization parameter, the same quantizationparameter also can be shared by the blocks in one quantization group. Inaddition, the other blocks in the quantization group may determine theirdelta quantization parameter on the basis of the delta quantizationparameter. In addition, the other blocks in the quantization group maydetermine their delta quantization parameter on the basis of the deltaquantization parameter.

Further alternatively, for example, when a CTU has a size of 32×32 andratio information specifying the size of a quantization group is 2, thesize of the quantization group may be set to 16×16. When the size of acurrent block is 32×16, a delta quantization parameter for the currentblock may be entropy-coded/entropy-decoded. When the maximum length(maximum value) of the horizontal length (width) and the vertical length(height) of the current block is longer than the length of thequantization group, the size of the quantization group may be set to thesize of the current block. Since the maximum length of the horizontallength (width) and the vertical length (height) of the current block islonger than the length of the quantization group, the delta quantizationparameter for the current block may be entropy-coded/entropy-decodedafter the IsCuDeltaQPCoded is set to a first value.

When a predetermined condition is satisfied, a delta quantizationparameter for each quantization group may not beentropy-coded/entropy-decoded. In this case, when the predeterminedcondition is satisfied, the IsCuDeltaQPCoded is set to 1 so that thedelta quantization parameter may not be entropy-coded/entropy-decoded.Here, the first value may be 1. The predetermined condition will bedescribed below.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 1, in a case where a current block has a blockdepth of 2 (i.e., a block having a size of 16×16), since the depth ofthe current block is greater than the depth of the quantization group,the IsCuDeltaQPCoded may be set to the first value so that the deltaquantization parameter for the current block may not beentropy-coded/entropy-encoded. In this case, since the IsCuDeltaQPCodedis set to the first value, the delta quantization parameters for theother blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization group,and the derived quantization parameter may be determined as thequantization parameter for the current block. That is, withoutperforming entropy-coding/entropy-decoding on the delta quantizationparameter, the predicted quantization parameter may be used as thequantization parameter for the current block as it is. When thediff_cu_qp_delta_depth is 1, the size of a quantization group may be setto 32×32.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 1, in a case where a current block has a blockdepth of 2 (i.e., the depth of a quadtree is 1, the depth of a binarytree is 1, and the block size is 32×16), since the depth of the currentblock is greater than the depth of the quantization group, theIsCuDeltaQPCoded may be set to the first value so that the deltaquantization parameter for the current block may not beentropy-coded/entropy-encoded. In this case, since the IsCuDeltaQPCodedis set to the first value, the delta quantization parameters for theother blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization groups,and the derived quantization parameter may be determined as thequantization parameter of the current block. That is, without performingentropy-coding/entropy-decoding on the delta quantization parameter, thepredicted quantization parameter may be used as the quantizationparameter for the current block as it is. The size of the quantizationgroup may be set on the basis of the quantization group depthinformation diff_cu_qp_delta_depth.

For example, when a CTU has a size of 64×64 and thediff_cu_qp_delta_depth is 1, in a case where a current block has a blockdepth of 2 (i.e., the depth of a quadtree is 1, the depth of amulti-type tree is 1, and the block size is 32×16), since the depth ofthe current block is greater than the depth of the quantization group,the IsCuDeltaQPCoded may be set to the first value so that the deltaquantization parameter for the current block may not beentropy-coded/entropy-encoded. In this case, since the IsCuDeltaQPCodedis set to the first value, the delta quantization parameters for theother blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization group,and the derived quantization parameter may be determined as thequantization parameter of the current block. That is, without performingentropy-coding/entropy-decoding on the delta quantization parameter, thepredicted quantization parameter may be used as the quantizationparameter of the current block as it is. The size of the quantizationgroup may be set on the basis of the quantization group depthinformation diff_cu_qp_delta_depth.

Further alternatively, for example, when a CTU has a size of 128×128 andlog2diff_cu_qp_delta_length (quantization group length information) is3, the size of a quantization group may be set to 16×16. When the sizeof a current block is 4×8, since the maximum length of the horizontallength and the vertical length of the current block is less than thelength of the quantization group, the IsCuDeltaQPCoded may be set to thefirst value so that a delta quantization parameter for the current blockmay not be entropy-coded/entropy-decoded. In this case, since theIsCuDeltaQPCoded is set to the first value, the delta quantizationparameters for the other blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization group,and the derived quantization parameter may be determined as thequantization parameter of the current block. That is, without performingentropy-coding/entropy-decoding on the delta quantization parameter, thepredicted quantization parameter may be used as the quantizationparameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 32×32 andlog2_diff_cu_qp_delta_length (quantization group length information) is1, the size of a quantization group may be set to 16×16. When the sizeof a current block is 8×4, since the maximum length of the horizontallength and the vertical length of the current block is less than thelength of the quantization group, the IsCuDeltaQPCoded may be set to thefirst value so that a delta quantization parameter for the current blockmay not be entropy-coded/entropy-decoded. In this case, since theIsCuDeltaQPCoded is set to the first value, the delta quantizationparameters for the other blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization groups,and the derived quantization parameter may be determined as thequantization parameter of the current block. That is, without performingentropy-coding/entropy-decoding on the delta quantization parameter, thepredicted quantization parameter may be used as the quantizationparameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 128×128 andlog4_diff_cu_qp_delta_area (quantization group area information) is 4,the size of a quantization group may be set to 8×8. When the size of acurrent block is 4×4, since the area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the first value so that a delta quantization parameter for thecurrent block may be entropy-coded/entropy-decoded. In this case, sincethe IsCuDeltaQPCoded is set to the first value, the delta quantizationparameters for the other blocks in the quantization group may not beentropy-coded/entropy-decoded. In this case, the quantization parametermay be derived from at least one of the neighboring quantization groupsto determine the quantization parameter of the current block. That is,without performing entropy-coding/entropy-decoding on the deltaquantization parameter, the predicted quantization parameter may be usedas the quantization parameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 64×64 andlog4_diff_cu_qp_delta_area (quantization group area information) is 2,the size of a quantization group may be set to 16×16. When the size of acurrent block is 16×8, since the area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the first value so that a delta quantization parameter for thecurrent block may not be entropy-coded/entropy-decoded. In this case,since the IsCuDeltaQPCoded is set to the first value, the deltaquantization parameters for the other blocks in the quantization groupmay not be entropy-coded/entropy-decoded. In this case, the quantizationparameter may be derived from at least one of the neighboringquantization groups, and the derived quantization parameter may bedetermined as the quantization parameter of the current block. That is,without performing entropy-coding/entropy-decoding on the deltaquantization parameter, the predicted quantization parameter may be usedas the quantization parameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 32×32 andlog4_diff_cu_qp_delta_area (quantization group area information) is 1,the size of a quantization group may be set to 16×16. When the size of acurrent block is 32×4, since the area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the first value so that a delta quantization parameter for thecurrent block may not be entropy-coded/entropy-decoded. In this case,since the IsCuDeltaQPCoded is set to the first value, the deltaquantization parameters for the other blocks in the quantization groupmay not be entropy-coded/entropy-decoded. In this case, the quantizationparameter may be derived from at least one of the neighboringquantization groups, and the derived quantization parameter may bedetermined as the quantization parameter of the current block. That is,without performing entropy-coding/entropy-decoding on the deltaquantization parameter, the predicted quantization parameter may be usedas the quantization parameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 64×64 andlog4_diff_cu_qp_delta_area (quantization group area information) is 2,the size of a quantization group may be set to 16×16. When the size of acurrent block is 8×16, since the area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the first value so that a delta quantization parameter for thecurrent block may not be entropy-coded/entropy-decoded. In this case,since the IsCuDeltaQPCoded is set to the first value, the deltaquantization parameters for the other blocks in the quantization groupmay not be entropy-coded/entropy-decoded. In this case, the quantizationparameter may be derived from at least one of the neighboringquantization groups, and the derived quantization parameter may bedetermined as the quantization parameter of the current block. That is,without performing entropy-coding/entropy-decoding on the deltaquantization parameter, the predicted quantization parameter may be usedas the quantization parameter of the current block as it is.

Further alternatively, for example, when a CTU has a size of 32×32 andlog4_diff_cu_qp_delta_area (quantization group area information) is 1,the size of a quantization group may be set to 16×16. When the size of acurrent block is 4×32, since the area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the first value so that a delta quantization parameter for thecurrent block may not be entropy-coded/entropy-decoded. In this case,since the IsCuDeltaQPCoded is set to the first value, the deltaquantization parameters for the other blocks in the quantization groupmay not be entropy-coded/entropy-decoded. In this case, the quantizationparameter may be derived from at least one of the neighboringquantization groups, and the derived quantization parameter may bedetermined as the quantization parameter of the current block. That is,without performing entropy-coding/entropy-decoding on the deltaquantization parameter, the predicted quantization parameter may be usedas the quantization parameter of the current block as it is.

Further alternatively, for example, according to a predeterminedpriority among the depth information, the length information, the areainformation, the ratio information, the shape information of thequantization group, the delta quantization parameter may not beentropy-coded/entropy-decoded.

A method of efficiently signaling delta quantization parameters usingquantization group size information in a block structure in which anon-square block (e.g., M×N block) exists will be described below indetail with reference to FIGS. 14 through 23. In FIGS. 14 through 23, Mand N are positive integers and may have different values.

FIG. 14 is a diagram illustrating encoding/decoding order for a casewhere a CU according to one embodiment of the present invention has asquare shape and a case where a CU has a non-square shape.

The size of a quantization group may be determined on the basis of thesize information, the depth information, the length information, thearea information, the ratio information, the shape information, and thesubdivision information of the quantization group. In the presentembodiment and/or other embodiments of the present invention, the areamay mean the area.

For example, the size of the quantization group may be determined usingthe depth information diff_cu_qp_delta_depth of the quantization group,and whether to signal the delta quantization parameter may be determinedaccording to the depth information of the quantization group and thedepth value of the current M×N block.

As another example, the size of a quantization group may be determinedusing log2_diff_cu_qp_delta_length, which is the length information ofthe quantization group, and whether to signal the delta quantizationparameter may be determined on the basis of the statistical value of thelength information of the quantization group and the minimum value orthe maximum value of the horizontal length (M) and the vertical length(N) of the current M×N block.

As a further example, the size of a quantization group may be determinedusing log4_diff_cu_qp_delta_area, which is the area information of thequantization group, and whether to signal the delta quantizationparameter may be determined on the basis of the area information of thequantization group and the product of the horizontal length (M) and thevertical length (N) of the current M×N block.

As a further example, the size of a quantization group may be determinedusing the subdivision information cu_qp_delta_subdiv of the quantizationgroup, and whether to signal the delta quantization parameter may bedetermined by comparing the subdivision information of the quantizationgroup and CbSubdiv which is the subdivision value of a block that iscurrently encoded/decoded.

The delta quantization parameter may be signaled for a block resultingfrom quadtree partitioning, binary tree partitioning, or ternary treepartitioning. Whether to signal the delta quantization parameter may bedetermined by comparing the depth of the block and thediff_cu_qp_delta_depth which is the quantization depth information.

For example, the quantization parameters may be signaled when the depthof the block is less than or equal to the quantization depthinformation.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the depth information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay be a non-square shape when the current block is a block resultingfrom multi-type tree partitioning.

As another example, when the depth of the block is greater than thedepth information of the quantization group, the quantization parametermay be signaled from the first block among the blocks resulting from thedivision. The other blocks except for the first block resulting from thepartitioning may share the delta quantization parameter of the firstblock. Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also may beshared by the blocks in one quantization group. The depth of the blockmay be at least one of the depth of a binary tree or the depth of aternary tree, or may be the sum of at least one of the depths of thetrees. The depth of the block may be at least one of the depth of abinary tree and the depth of a ternary tree, or the sum of at least twoof the depths of the trees.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the depth information of the quantization group,the size of the current block, and the size of at least one of theparent nodes of the current block. The size of the quantization groupfor the current block may be set equal to the size of at least one ofthe parent nodes of the current block corresponding to the depthinformation of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the depth information of the quantization group. Thequantization group for the current block may have a non-square shape.

As another example, the delta quantization parameter may be signaled foreach quadtree block. That is, the delta quantization parameter may notbe signaled for a binary tree block or a ternary tree block. The binarytree block or the ternary tree block may use the delta quantizationparameter signaled for the quadtree block. The binary tree block or theternary block may share the delta quantization parameter signaled forthe quadtree block. Alternatively, the quantization parameter of thebinary tree block or the ternary tree block may be determined on thebasis of the quantization parameter of the quadtree block.Alternatively, the quantization parameter of the quadtree block may bedetermined as the quantization parameter of the binary tree block or theternary tree block.

As another example, the quantization parameter may be signaled when thedepth of the quadtree block and the binary tree block is less than orequal to the quantization depth information.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the depth information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay have a non-square shape when the current block is a block resultingfrom binary tree partitioning.

As another example, when the depth of a block generated through binarytree partitioning is greater than the depth of the quantization group,the delta quantization parameter may be signaled for only one of the twoblocks. The other block may share the delta quantization parameter thatis signaled. Since the blocks in one quantization group use the samepredicted quantization parameter, the same quantization parameter alsomay be shared by the blocks in one quantization group. The only oneblock may be the first block of the two blocks generated through binarytree partitioning. Here, the first block may mean the first block amongthe blocks of which the coding block flag is not the first value. Here,the first value may be 0.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the depth information of the quantization group,the size of the current block, and the size of at least one of theparent nodes of the current block. The size of the quantization groupfor the current block may be set equal to the size of at least one ofthe parent nodes of the current block corresponding to the depthinformation of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the depth information of the quantization group. Thequantization group for the current block may have a non-square shape.

As another example, the delta quantization parameter may be signaledwhen the depth of a block generated through quadtree partitioning orternary tree partitioning is less than or equal to the quantizationdepth information.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the depth information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay be a non-square shape when the current block is a block resultingfrom ternary tree partitioning.

As another example, when the depth of a block generated through ternarytree partitioning is greater than the depth of the quantization group,the delta quantization parameter may be signaled for only one of thethree blocks. The other blocks may share the delta quantizationparameter that is signaled. Since the blocks in one quantization groupuse the same predicted quantization parameter, the same quantizationparameter also may be shared by the blocks in one quantization group.The only one block may be the first block of the two blocks generatedthrough ternary tree partitioning. The only one block may be a blockthat has the largest area among the three blocks generated throughternary tree partitioning.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the depth information of the quantization group,the size of the current block, and the size of at least one of theparent nodes of the current block. The size of the quantization groupfor the current block may be set equal to the size of at least one ofthe parent nodes of the current block corresponding to the depthinformation of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the depth information of the quantization group. Thequantization group for the current block may have a non-square shape.

As another example, the delta quantization parameter may be signaledwhen the depth of a block generated through quadtree partitioning ormulti-type tree partitioning is less than or equal to the quantizationdepth information.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the depth information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay be a non-square shape when the current block is a block resultingfrom multi-type tree partitioning.

As another example, when the depth of a block generated through quadtreepartitioning or multi-type partitioning is greater than the depth of thequantization group, the delta quantization parameter may be signaled foronly one of the two or more blocks. The other block(s) may share thedelta quantization parameter that is signaled. Since the blocks in onequantization group use the same predicted quantization parameter, thesame quantization parameter also may be shared by the blocks in onequantization group. The only one block may be the first block among thetwo or more blocks generated through partitioning. The only one blockmay be a block that has the largest area among the two or more blocksgenerated through partitioning. The only one block may be a block thathas the smallest area among the two or more blocks generated throughpartitioning.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the depth information of the quantization group,the size of the current block, and the size of at least one of theparent nodes of the current block. The size of the quantization groupfor the current block may be set equal to the size of at least one ofthe parent nodes of the current block corresponding to the depthinformation of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the depth information of the quantization group. Thequantization group for the current block may have a non-square shape.

The delta quantization parameter may be signaled for a block resultingfrom quadtree partitioning, binary tree partitioning, or ternary treepartitioning. Whether to signal the delta quantization parameter may bedetermined by comparing the area of the block and the size of thequantization group set according to the diff_cu_qp_delta_area, which isthe area information of the quantization group.

For example, the delta quantization parameter may be signaled when thearea of the block is smaller than or equal to the size of thequantization group.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay be a non-square shape when the current block is a block resultingfrom multi-type tree partitioning.

As another example, when the area of a block generated through binarytree partitioning is larger than the size of the quantization group, thedelta quantization parameter may be signaled for only one of the twoblocks resulting from the binary tree partitioning. The quantizationparameters for the other blocks may be determined on the basis of thesignaled delta quantization parameter.

As another example, when the area of the block is smaller than the sizeof the quantization group, the quantization parameter may be signaledfrom the first block among the blocks resulting from the partitioning.The other blocks except for the first block resulting from thepartitioning may share the delta quantization parameter of the firstblock. Since the blocks in one quantization group use the same predictedquantization parameter, the same quantization parameter also may beshared by the blocks in one quantization group. Here, the area of theblock may be the area of a quadtree or the area of a multi-type tree.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the area information of the quantization group,the area of the current block, and the size of at least one of theparent nodes of the current block. The size of the quantization groupfor the current block may be set equal to the size of at least one ofthe parent nodes of the current block corresponding to the areainformation of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the area information of the quantization group. Thequantization group for the current block may have a non-square shape.

As another example, when the area of a block resulting from ternary treepartitioning is smaller than the size of the quantization group, thedelta quantization parameter may be signaled for only one block havingthe largest area among the three blocks. The other blocks may share thedelta quantization parameter that is signaled. As another example, whenthe area of a block resulting from ternary tree partitioning is smallerthan the size of the quantization group, the delta quantizationparameter may be signaled for only one block having the smallest areaamong the three blocks resulting from the partitioning. The other blocksmay share the delta quantization parameter of the block having thesmallest area.

On the other hand, the shape of the current block that isencoded/decoded may be a quadtree, a binary tree, or a ternary tree.When the shape is a quadtree, an area difference valuediff_cur_block_area_minus4 between the quadtree blocks may be acquiredby Expression 26.

$\begin{matrix}{{{diff\_ cur}{\_ block}{\_ area}{\_ minus}\mspace{11mu} 4} = {{2 \star {\log\; 2{\_ ctu}{\_ size}{\_ minus}\mspace{11mu} 2}} - {\log\; 2{\_ current}{\_ block}{\_ area}{\_ minus}\mspace{11mu} 4}}} & \left\lbrack {{Expression}\mspace{14mu} 26} \right\rbrack\end{matrix}$

In Expression 26, log2_ctu_size_minus2 represents a value that isobtained by performing a log2 function on the maximum CTU size and thensubtracting 2 from the result of the log2 function. Thelog2_current_block_area_minus4 is a value obtained by performing a log2function on the product of the horizontal length and the vertical lengthof the current block and subtracting 4 from the result of the log2function.

For example, when the current block is a block resulting from quadtreepartitioning, in a case where the diff_cur_block_area_minus4 is smallerthan or equal to the area information of the quantization group, thedelta quantization parameter may be signaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning.

For example, when the current block is a block resulting from binarytree partitioning, in a case where the diff_cur_block_area_minus4 issmaller than or equal to the area information of the quantization group,the delta quantization parameter may be signaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may have anon-square shape when the current block is a block resulting from binarytree partitioning.

For example, when the current block is a block resulting from ternarytree partitioning, in a case where the diff_cur_block_area_minus4 issmaller than or equal to the area information of the quantization group,the delta quantization parameter may be signaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup. In this case, the size of the quantization group for the currentblock may be set equal to the size of the current block.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

For example, when the current block is a block resulting from ternarytree partitioning, in a case where the diff_cur_block_area_minus4 islarger than the area information of the quantization group, the deltaquantization parameter may be signaled from the first block among theblocks resulting from the ternary tree partitioning. In this case, inthe case of the middle block among the three blocks resulting fromternary tree partitioning, even though the diff_cur_block_area_minus4 issmaller than or equal to the area information of the quantization group,the delta quantization parameter may not be signaled but may bepredicted or derived from an already encoded/decoded block. In the caseof the last block among the three blocks resulting from ternary treepartitioning, the delta quantization parameter may not be signaled butmay be predicted or derived from an already encoded/decoded block.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

For example, when the current block is a block resulting from ternarytree partitioning, in a case where the diff_cur_block_area_minus4 islarger than the area information of the quantization group, the deltaquantization parameter may be signaled from the first block among theblocks resulting from the ternary tree partitioning. In this case, inthe case of the middle block among the three blocks resulting fromternary tree partitioning, even though the diff_cur_block_area_minus4 issmaller than or equal to the area information of the quantization group,the delta quantization parameter may not be signaled. In the case of thelast block among the three blocks resulting from ternary treepartitioning, the delta quantization parameter may not be signaled butmay be predicted or derived from an already encoded/decoded block.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the area information of the quantizationgroup.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

The delta quantization parameter may be signaled for a block resultingfrom quadtree partitioning, binary tree partitioning, or ternary treepartitioning. Whether to signal the delta quantization parameter may bedetermined by comparing the subdivision value of the block and thediff_cu_qp_delta_subdiv which is the subdivision information of thequantization group.

For example, the delta quantization parameter may be signaled when thesubdivision value of the current block is less than or equal to thesubdivision information of the quantization group.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning. The shape of the quantization group for the current blockmay be a non-square shape when the current block is a block resultingfrom multi-type tree partitioning.

As another example, when the subdivision value of the block is greaterthan the subdivision information of the quantization group, thequantization parameter may be signaled from the first block among theblocks resulting from the partitioning. The other blocks except for thefirst block resulting from the partitioning may share the deltaquantization parameter of the first block. Since the blocks in onequantization group use the same predicted quantization parameter, thesame quantization parameter also may be shared by the blocks in onequantization group. Here, the area of the block may be the area of aquadtree or the area of a multi-type tree.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, the subdivision information of the quantizationgroup, the subdivision value of the current block, and the size of atleast one of the parent nodes of the current block. The size of thequantization group for the current block may be set equal to the size ofat least one of the parent nodes of the current block corresponding tothe subdivision information of the quantization group.

The shape of the quantization group for the current block may be thesame as that of at least one of the parent nodes of the current blockcorresponding to the subdivision information of the quantization group.The quantization group for the current block may have a non-squareshape.

On the other hand, the subdivision value may be allocated every blockand may be used together with the depth value of the block.

In addition, the subdivision value may be calculated in a mannerdescribed below.

The shape of the current block may be at least one of a quadtree, abinary tree, or a ternary tree, and the current block may be partitionedinto a quadtree form, a binary tree form, or a ternary tree form.

For example, when the current block is partitioned into a quadtree form,the subdivision value of each sub-block resulting from the quadtreepartitioning may be set to a value obtained by adding 2 to thesubdivision value of the current block.

As another example, when the current block is partitioned into a binarytree form, the subdivision value of each sub-block resulting from thebinary tree partitioning may be set to a value obtained by adding 1 tothe subdivision value of the current block.

As another example, when the current block is divided into a ternarytree form, the subdivision value of each of the left and rightsub-blocks among the three sub-block resulting from the ternary treepartitioning may be set to a value obtained by adding 2 to thesubdivision value of the current block, and the subdivision value of themiddle sub-block among the three sub-blocks resulting from the ternarytree partitioning may be set to a value obtained by adding 1 to thesubdivision value of the current block.

As another example, when the current block is divided into a ternarytree form, whether to signal the delta quantization parameter may bedetermined by comparing the subdivision information of the quantizationgroup with the value obtained by adding two to the subdivision value(hereinafter, also referred to as original subdivision value) of thecurrent block that is not yet partitioned.

As another example, when the current block is a block resulting fromquadtree partitioning, in a case where the subdivision value of thecurrent block is smaller than or equal to the subdivision information ofthe quantization group, the delta quantization parameter may besignaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may be asquare shape when the current block is a block resulting from quadtreepartitioning.

As another example, when the current block is a block resulting frombinary tree partitioning, in a case where the subdivision value of thecurrent block is smaller than or equal to the subdivision information ofthe quantization group, the delta quantization parameter may besignaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may have anon-square shape when the current block is a block resulting from binarytree partitioning.

As another example, when the current block is a block resulting fromternary tree partitioning, in a case where the subdivision value of thecurrent block is smaller than or equal to the subdivision information ofthe quantization group, the delta quantization parameter may besignaled.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

As another example, when the current block is a block resulting fromternary tree partitioning, in a case where the subdivision value of thecurrent block is greater than the subdivision information of thequantization group, the delta quantization parameter may be signaledfrom the first block among the blocks resulting from the partitioning.In this case, in the case of the middle block among the three blocksresulting from ternary tree partitioning, even though the subdivisionvalue of the block is smaller than or equal to the subdivisioninformation of the quantization group, the delta quantization parametermay not be signaled but may be predicted or derived from an alreadyencoded/decoded block. In the case of the last block among the threeblocks resulting from ternary tree partitioning, the delta quantizationparameter may not be signaled but may be predicted or derived from analready encoded/decoded block.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

As another example, when the current block is a block resulting fromternary tree partitioning, in a case where the subdivision value of theblock is greater than the subdivision information of the quantizationgroup, the delta quantization parameter may be signaled from the firstblock among the blocks resulting from the partitioning. In the case ofthe middle block among the three blocks resulting from ternary treepartitioning, even though the cu_qp_delta_subdiv is less than or equalto the subdivision information of the quantization group, the deltaquantization parameter may be signaled. In the case of the last blockamong the three blocks resulting from ternary tree partitioning, thedelta quantization parameter may not be signaled but may be predicted orderived from an already encoded/decoded block.

Here, the size of the quantization group for the current block may beset according to at least one of the delta quantization parameterutilization flag, information on whether the delta quantizationparameter is signaled, and the subdivision information of thequantization group. In this case, the size of the quantization group forthe current block may be set equal to the size of the current block.

The shape of the quantization group for the current block may be anon-square shape when the current block is a block resulting fromternary tree partitioning.

On the other hand, the delta quantization parameters may be signaled ona per transform unit (TU) basis, on a per block basis, or on a percoding unit (CU) basis. The size of the TU may be equal to the size ofthe CU. Alternatively, the size of the TU may be smaller than the sizeof the CU.

Here, the first block may mean the first block among the blocks of whichthe coding block flag is not a first value. Here, the first value may be0.

In addition, the delta quantization parameter utilization flag may becu_qp_delta_enabled_flag.

Also, whether the delta quantization parameter is signaled may be atleast one of cu_qp_delta_enabled_flag and IsCuDeltaQPCoded.

The delta quantization parameter may be signaled depending on the sizeof the CTU, the diff_cu_qp_delta_depth which is the depth information ofthe quantization group, the log2_diff_cu_qp_delta_length which is thelength information of the quantization group, the diff_cu_qp_delta_areawhich is the area information of the quantization group, thecu_qp_delta_subdiv which is the subdivision information of thequantization group, and/or the size of the quantization group.

Hereinafter, for a case where a CTU has a size of 128×128 and adiff_cu_qp_delta_depth which is the depth information of a quantizationgroup is 2, an embodiment in which a delta quantization parameter issignaled will be described in more detail. In this case, the size of thequantization group may be set to the size of the current block.

For example, when the current block is partitioned two times by quadtreepartitioning and one time by binary tree partitioning, the current blockmay have a depth of 3 and a size of 32×16 or 16×32. When the depthinformation of the quantization group is 2, since the depth informationof the quantization group is less than or equal to the depth of thecurrent block, a delta quantization parameter for the first block amongthe blocks resulting from the binary tree partitioning may be signaled.Also, the delta quantization parameter of the first block may be sharedby the other blocks among the blocks resulting from the binary treepartitioning at the depth of 2. Since the blocks in one quantizationgroup use the same predicted quantization parameter, the samequantization parameter also may be shared by the blocks in onequantization group.

As another example, when the current block is partitioned one time byquadtree partitioning, the current block may have a depth of 1 and asize of 64×64. When the depth information of the quantization group is2, since the depth information of the quantization group is greater thanthe depth of the current block, the delta quantization parameter for thecurrent block may be signaled.

As another example, when the current block is partitioned by quadtreepartitioning one time, by binary tree partitioning one time, and byternary tree partitioning one time, the current block may have a depthof 3 and a size of 16×32 or 32×16. When the depth information of thequantization group is 2, since the depth information of the quantizationgroup is less than or equal to the depth of the current block, a deltaquantization parameter for the first block among the blocks resultingfrom the ternary tree partitioning at the depth of 2 may be signaled.The delta quantization parameter for the first block may be shared bythe other blocks among the blocks resulting from the ternary treepartitioning at the depth of 2. Since the blocks in one quantizationgroup use the same predicted quantization parameter, the samequantization parameter also may be shared by the blocks in onequantization group.

As another example, when the current block is partitioned by quadtreepartitioning one time and by multi-type tree partitioning two times, thecurrent block may have a depth of 3 and a size of 16×16. When the depthinformation of the quantization group is 2, since the depth informationof the quantization group is less than or equal to the depth of thecurrent block, a delta quantization parameter for the first block amongthe blocks resulting from the multi-type tree partitioning at the depthof 2 may be signaled. The delta quantization parameter for the firstblock may be shared by the other blocks among the blocks resulting fromthe multi-type tree partitioning at the depth of 2. Since the blocks inone quantization group use the same predicted quantization parameter,the same quantization parameter also may be shared by the blocks in onequantization group.

As another example, when the current block is partitioned by quadtreepartitioning three times and by ternary tree partitioning one time, thecurrent block may have a depth of 4 and a size of 4×16. When the depthinformation of the quantization group is 2, since the depth informationof the quantization group is less than or equal to the depth of thecurrent block, a delta quantization parameter for the first block amongthe blocks resulting from the quadtree partitioning may be signaled. Thedelta quantization parameter of the first block may be shared by theother blocks among the blocks resulting from the binary treepartitioning at the depth of 2. Since the blocks in one quantizationgroup use the same predicted quantization parameter, the samequantization parameter also may be shared by the blocks in onequantization group.

When the depth information of the current block is greater than thedepth information of the quantization group, the depth information ofthe quantization group may be set as a basic unit on a basis of whichencoding/decoding is performed. The size of the quantization group maybe set using the depth information of the quantization group.

When the depth information of the current block is equal to or less thanthe depth information of the quantization group, the current block maybe set as a basic unit on a basis of which encoding/decoding isperformed. The size of the current block may be set as the size of thequantization group.

The current block may be partitioned in the order of by quadtreepartitioning, binary tree partitioning, and ternary tree partitioning.

Here, the first block may mean the first block among the blocks of whichthe coding block flag is not a first value. Here, the first value may be0.

Hereinafter, for a case where a CTU has a size of 128×128 and alog2_diff_cu_gp_delta_length which is the length information of aquantization group is 2, an embodiment in which a delta quantizationparameter is signaled will be described in more detail. In this case,the size of the quantization group may be determined to be 32×32. Thatis, as shown in Table 3, the horizontal or vertical length of thequantization group may be determined to be 32, and the size of thequantization group may be determined to be 32×32.

TABLE 3 horizontal or horizontal or horizontal or vertical verticalvertical length of length of length of quantization quantizationquantization group group group according to according to according tolog2_diff_cu_ 256x256 CTU 128x128 CTU 64x64 CTU qp_delta_length sizesize sizes 0 256 128 64 1 128 64 32 2 64 32 16 3 32 16 8 4 16 8 4

For example, when the size of the current block resulting from binarytree partitioning is 32×64, since the maximum length among thehorizontal length and the vertical length of the current block isgreater than the length of the quantization group, the deltaquantization parameter for the current block may be signaled. In thiscase, the size of the quantization group may be set to the size of thecurrent block.

As another example, when the size of the current block resulting fromvertical ternary tree partitioning is 24×32, since the maximum lengthamong the horizontal length and the vertical length of the current blockis greater than the length of the quantization group, the deltaquantization parameter for the current block may be signaled. In thiscase, the size of the quantization group may be set to the size of thecurrent block. For an 8×32 block that is adjacent to the current blockand that results from binary tree partitioning of the same parent nodeas the current block, a delta quantization parameter may not besignaled. The 8×32 block may use the delta quantization parameter of thecurrent block as it is. That is, the quantization parameter may beshared by a 24×32 block and an 8×32 block. In another case, that is, foran 8×32 block that is adjacent to the current block and that resultsfrom binary tree partitioning of the same parent node as the currentblock, a delta quantization parameter may not be signaled. The deltaquantization parameter for the 8×32 block may be determined on the basisof the delta quantization parameter of the current block.

As another example, when the size of the current block is 32×16, sincethe maximum length among the horizontal length and the vertical lengthof the current block is greater than the length of the quantizationgroup, the delta quantization parameter for the current block may besignaled. In this case, the size of the quantization group may be set tothe size of the current block. In this case, for a 32×16 block that isadjacent to the current block and that results from binary treepartitioning of the same parent node as the current block, a deltaquantization parameter may not be signaled. The 32×16 block and thecurrent block may share the same delta quantization parameter. That is,the quantization parameter may be shared by two blocks having a size of32×16. In another case, that is, for a 32×16 block that is adjacent tothe current block and that results from binary tree partitioning of thesame parent node as the current block, a delta quantization parametermay not be signaled. The 32×16 block and the current block may share thesame delta quantization parameter.

As another example, when the size of the current block that results fromhorizontal ternary tree partitioning is 16×64, since the maximum lengthamong the horizontal length and the vertical length of the current blockis greater than the length of the quantization group, the deltaquantization parameter for the current block may be signaled. In thiscase, the size of the quantization group may be set to the size of thecurrent block.

As another example, when the size of the current block that results fromvertical ternary tree partitioning is 8×32, since the maximum lengthamong the horizontal length and the vertical length of the current blockis greater than the length of the quantization group, the deltaquantization parameter for the current block may be signaled. In thiscase, the size of the quantization group may be set to the size of thecurrent block. For an 8×32 block and a 16×32 block that are adjacent tothe current block and that results from ternary tree partitioning of thesame parent node as the current block, a delta quantization parametermay not be signaled. These blocks may share the delta quantizationparameter of the current block. That is, the quantization parameter maybe shared by two 8×32 blocks and one 16×32 block. In another case, thatis, for a 16×32 block and an 8×32 block that are adjacent to the currentblock and that results from ternary tree partitioning of the same parentnode as the current block, delta quantization parameters may not besignaled. The delta quantization parameters may be determined on thebasis of the delta quantization parameter of the current block.

When the maximum length among the horizontal length and the verticallength of the current block is greater than the length of thequantization group, the size of the quantization group may be set to thesize of the current block.

In addition, when the maximum length among the horizontal length and thevertical length of the current block is equal to the length of thequantization group, the size of the quantization group may be setaccording to the to the log2_diff_cu_qp_delta_length which is the lengthinformation of the quantization group.

In addition, when the maximum length among the horizontal length and thevertical length of the current block has a predetermined relationshipwith length of the quantization group, the size of the quantizationgroup may be set according to the to the log2_diff_cu_qp_delta_lengthwhich is the length information of the quantization group. For example,the predetermined relationship may one of multiples of two.

Hereinafter, for a case where a CTU has a size of 128×128 and wherediff_cu_qp_delta_area which is the area information of a quantizationgroup is 3, an embodiment in which a delta quantization parameter issignaled will be described in more detail. As shown in Table 4, the areaof a quantization group may be 2¹¹.

TABLE 4 area of area of area of quantization quantization quantizationgroup group group according to according to according to diff_cu_qp_256x256 128x128 64x64 delta_depth CTU size CTU size CTU size 0 2¹⁶(=256*256) 2¹⁴ 2¹² 1 2¹⁵ 2¹³ 2¹¹ 2 2¹⁴ 2¹² 2¹⁰ 3 2¹³ 2¹¹ 2⁹ 4 2¹² 2¹⁰ 2⁸5 2¹¹ 2⁹ 2⁷ 6 2¹⁰ 2⁸ 2⁶ 7 2⁹ 2⁷ 2⁵ 8 2⁸ 2⁶ 2⁴ 9 2⁷ 2⁵ 10 2⁶ 2⁴ 11 2⁵ 122⁴

For example, when the size of the current block resulting from quadtreepartitioning is 64×64, the area difference valuediff_cur_block_area_minus4 of the current block may be 2. At this time,since the area difference value is less than or equal to the areainformation of the quantization group, the delta quantization parameterfor the current block may be signaled. In this case, the size of thequantization group may be set to the size of the current block.

As another example, when the size of the current block resulting fromquadtree partitioning is 32×32, the area difference valuediff_cur_block_area_minus4 of the current block may be 4. At this time,since the area difference value is less than or equal to the areainformation of the quantization group, the delta quantization parameterfor the first block among the blocks resulting from quadtreepartitioning may be signaled. The other blocks may use the deltaquantization parameter signaled from the first block. In this case, thesize of the quantization group may be set to 64×64 which is the size ofthe parent block of the current block.

As another example, when the size of the current block resulting frombinary tree partitioning is 32×64, the area difference valuediff_cur_block_area_minus4 of the current block may be 3. At this time,since the area difference value is less than or equal to the areainformation of the quantization group, the delta quantization parameterfor the current block may be signaled. In this case, the size of thequantization group may be set to the size of the current block.

As another example, when the size of the current block resulting frombinary tree partitioning is 32×16, the area difference valuediff_cur_block_area_minus4 of the current block may be 5. In this case,since the area difference value is greater than the area information ofthe quantization group, the delta quantization parameter for the firstblock among the blocks resulting from the binary tree partitioning maybe signaled. The other blocks may share the delta quantization parameterof the first block. In this case, the size of the quantization group is32×32 which is the size of the first parent block of the current block.That is, the size of the quantization group is larger than the areainformation of the quantization group. Thus, the size of thequantization group may be set to 64×64 which is the second parent block.

As another example, when the size of the current block resulting fromternary tree partitioning is 16×64, the area difference valuediff_cur_block_area_minus4 of the current block may be 4. In this case,since the area difference value is greater than the area information ofthe quantization group, when the current block is the first block amongthe blocks resulting from the ternary tree partitioning, the deltaquantization parameter may be signaled. The other blocks having a sizeof 16×64 may use the delta quantization parameter of the first block. Inthe case of the middle block having a size of 32×64, the area differencevalue of the middle block is 3. That is, the area difference value issmaller than or equal to the area information of the quantization group.However, since whether to signal the delta quantization parameter forthe middle block is determined on the basis of information of whetherthe delta quantization parameter for the first block among the blocksresulting from the ternary tree partitioning is signaled, the deltaquantization parameter for the middle block may not be signaled, and thedelta quantization parameter for another block within the samequantization group may be shared.

As another example, when the size of the current block resulting fromternary tree partitioning is 64×32, the area difference valuediff_cur_block_area_minus4 of the current block may be 3. In this case,since the area difference value is less than or equal to the areainformation of the quantization group, the delta quantization parameterfor the current block may be signaled. In this case, the size of thequantization group may be set to the size of the current block.

When the area information of the current block is less than the areainformation of the quantization group, the current block may be set as abasic unit on a basis of which encoding/decoding is performed. The sizeof the current block may be set as the size of the quantization group.

The current block may be partitioned by quadtree partitioning, by binarytree partitioning, and ternary tree partitioning in this order.

Here, the first block may mean the first block among the blocks of whichthe coding block flag is not a first value. Here, the first value may be0.

Hereinafter, for a case where a CTU has a size of 128×128 and wherediff_cu_qp_delta_subdiv which is the subdivision information of aquantization group is 3, an embodiment in which a delta quantizationparameter is signaled will be described in more detail. In thisembodiment, the subdivision value cbSubdiv of a current block to beencoded/decoded may be used.

For example, when the size of the current block resulting from quadtreepartitioning is 64×64, the subdivision value cbSubdiv of the currentblock may be 2. In this case, since the subdivision value of the currentblock is less than or equal to the subdivision information of thequantization group, the delta quantization parameter for the currentblock may be signaled. In this case, the size of the quantization groupmay be set to the size of the current block.

As another example, when the size of the current block resulting fromquadtree partitioning is 32×32, the subdivision value cbSubdiv of thecurrent block may be 4. In this case, since the subdivision value isgreater than the subdivision information of the quantization group, thedelta quantization parameter for the first block among the blocksresulting from the quadtree partitioning may be signaled. The otherblocks may use the delta quantization parameter signaled from the firstblock. In this case, the size of the quantization group may be set to64×64 which is the size of the parent block of the current block.

As another example, when the size of the current block resulting frombinary tree partitioning is 32×64, the subdivision value cbSubdiv of thecurrent block may be 3. In this case, since the subdivision value isequal to the subdivision information of the quantization group, thedelta quantization parameter for the current block may be signaled. Inthis case, the size of the quantization group may be set to the size ofthe current block.

As another example, when the size of the current block resulting frombinary tree partitioning is 32×16, the subdivision value cbSubdiv of thecurrent block may be 5. In this case, since the subdivision value isgreater than the subdivision information of the quantization group, thedelta quantization parameter for the first block among the blocksresulting from the binary tree partitioning may be signaled. The otherblocks may share the delta quantization parameter of the first block. Inthis case, the size of the quantization group is 32×32 which is the sizeof the first parent block of the current block. That is, the size of thequantization group is larger than the area information of thequantization group. Thus, the size of the quantization group may be setto 64×64, which is the second parent block.

As another example, when the size of the current block resulting fromternary tree partitioning is 16×64, the subdivision value cbSubdiv ofthe current block may be 4. In this case, since the subdivision value isgreater than the subdivision information of the quantization group, whenthe current block is the first block among the blocks resulting from theternary tree partitioning, the delta quantization parameter may besignaled. The other blocks having a size of 16×64 may use the deltaquantization parameter of the first block. In the case of the middleblock, it has a size of 32×64. Therefore, the subdivision value of themiddle block is 3. That is, the subdivision value of the middle block issmaller than or equal to the subdivision information of the quantizationgroup. However, since whether to signal the delta quantization parameterfor the middle block is determined on the basis of information ofwhether the delta quantization parameter for the first block among theblocks resulting from the ternary tree partitioning is signaled, thedelta quantization parameter for the middle block may not be signaled,and the delta quantization parameter for another block within the samequantization group may be shared.

As another example, when the size of the current block resulting fromternary tree partitioning is 64×32, the subdivision value cbSubdiv ofthe current block may be 3. In this case, since the subdivision value ofthe current block is less than or equal to the subdivision informationof the quantization group, the delta quantization parameter for thecurrent block may be signaled. In this case, the size of thequantization group may be set to the size of the current block.

When the subdivision information of the current block is less than thesubdivision information of the quantization group, the current block maybe set as a basic unit on a basis of which encoding/decoding isperformed. The size of the current block may be set as the size of thequantization group.

The current block may be partitioned in the order of by quadtreepartitioning, binary tree partitioning, and ternary tree partitioning.

Here, the first block may mean the first block among the blocks of whichthe coding block flag is not a first value. Here, the first value may be0.

FIG. 15 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 256×256 size and a diff_cu_qp_delta_depth is2. Referring to FIG. 15, each block for which a delta quantizationparameter is signaled is displayed in grey, and each quantization groupis demarcated by a bold solid line.

FIG. 16 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 256×256 size and alog2_diff_cu_qp_delta_length is 1. Referring to FIG. 16, each block forwhich a delta quantization parameter is signaled is colored gray, andeach quantization group is demarcated by a bold solid line.

FIG. 17 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 128×128 size and a diff_cu_qp_delta_depth is2. Referring to FIG. 17, each block for which a delta quantizationparameter is signaled is colored gray, and each quantization group isdemarcated by a bold solid line.

FIG. 18 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 128×128 size and alog2_diff_cu_gp_delta_length is 2. Referring to FIG. 18, each block forwhich a delta quantization parameter is signaled is colored gray, andeach quantization group is demarcated by a bold solid line.

FIG. 19 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and alog2_diff_cu_qp_delta_length is 3. Referring to FIG. 19, each block forwhich a delta quantization parameter is signaled is displayed in grey,and each quantization group is demarcated by a bold solid line.

FIG. 20 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a diff_cu_qp_delta_area is 3.Referring to FIG. 20, each block for which a delta quantizationparameter is signaled is displayed in grey, and each quantization groupis demarcated by a bold solid line.

FIG. 21 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a diff_cu_qp_delta_area is 4.Referring to FIG. 21, each block for which a delta quantizationparameter is signaled is displayed in grey, and each quantization groupis demarcated by a bold solid line.

FIG. 22 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a cu_qp_delta_subdiv is 3.Referring to FIG. 22, each block for which a delta quantizationparameter is signaled is displayed in grey, and each quantization groupis demarcated by a bold solid line.

FIG. 23 is a diagram illustrating blocks for each of which a deltaquantization parameter is signaled and various quantization groups thatcan be set when a CTU has a 64×64 size and a cu_gp_delta_subdiv is 4.Referring to FIG. 23, each block for which a delta quantizationparameter is signaled is displayed in grey, and each quantization groupis demarcated by a bold solid line.

FIG. 24 is a diagram illustrating a method of determining a quantizationparameter, using length information of a quantization group according toone embodiment of the present invention.

In step S2401, cu_qp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 24), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 24), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,log2_diff_cu_qp_delta_length which is the length information of aquantization group may be entropy-coded/entropy-decoded in step S2402.

Accordingly, in step S2403, at least one of the length (QG_length) ofthe quantization group and the size of the quantization group may bedetermined on the basis of the log2_diff_cu_qp_delta_length which is thelength information of the quantization group.

In step S2401, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andmay be CU by CU. Here, the CU may mean at least one of a prediction unit(PU), a transform unit (TU), and a block. In this step, IsCuDeltaQPCodedmay be set to a second value.

When the maximum length (maximum value) among the horizontal length (CUwidth) and the vertical length (CU_height) of the current block is equalto or greater than the length of the quantization group in step S2405,the IsCuDeltaQPCoded may be set to the first value in step S2406.

In step S2407, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 24), the CTU can be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 24) instep S2407, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 24) in stepS2408, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2409, a flag (IsLastCuCoded)indicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 24) in stepS2409, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 24), thenext target CU is encoded/decoded.

In step S2408, when the coding block flag is the second value (No inFIG. 24), whether IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2410, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 24), the flag (IsLastCuCoded) indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 24) instep S2410, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2411, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2412, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2413, the delta quantization parameter and the predictedquantization parameter are added to determine the quantizationparameter.

In step S2409, the flag (IsLastCuCoded) indicating whether the last CUin the CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

FIG. 25 is a diagram illustrating a method of determining a quantizationparameter, using area information of a quantization group according toone embodiment of the present invention.

In step S2501, cu_qp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 25), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 25), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,log4_diff_cu_qp_delta_area which is the area information of aquantization group may be entropy-coded/entropy-decoded in step S2502.

Accordingly, in step S2503, at least one of the area (QG_area) of thequantization group and the size of the quantization group may bedetermined on the basis of the area information of the quantizationgroup, i.e., at least one of the diff_cu_qp_delta_area and thelog4_diff_cu_qp_delta_area.

In step S2504, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

In step S2505, when the area CU_area of the current block is equal to orlarger than the area of the quantization group, the IsCuDeltaQPCoded canbe set to the first value in step S2506.

In step S2507, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 25), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 25) instep S2507, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 25) in stepS2508, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2509, a flag (IsLastCuCoded)indicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 25) in stepS2509, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 25), thenext target CU is encoded/decoded.

In step S2508, when the coding block flag is the second value (No inFIG. 25), whether IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2510, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 25), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 25) instep S2510, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2511, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2512, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2513, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

In step S2509, the flag IsLastCuCoded indicating whether the last CU inthe CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

FIG. 26 is a diagram illustrating a method of determining a quantizationparameter, using length information of a quantization group according toanother embodiment of the present invention.

In step S2601, a flag cu_gp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 26), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 26), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,log2diff_cu_qp_delta_length which is the length information of aquantization group may be entropy-coded/entropy-decoded in step S2602.

Accordingly, in step S2603, at least one of the length (QG_length) ofthe quantization group and the size of the quantization group may bedetermined on the basis of the log2_diff_cu_qp_delta_length which is thelength information of the quantization group.

In step S2604, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

When the maximum length (maximum value) among the horizontal length (CUwidth) and the vertical length (CU_height) of the current block is equalto or greater than the length of the quantization group in step S2605,the IsCuDeltaQPCoded may be set to the first value in step S2606.

When the maximum length (maximum value) among the horizontal length (CUwidth) and the vertical length (CU_height) of the current block is lessthan the length of the quantization group in step S2605, theIsCuDeltaQPCoded may be set to the second value in step S2606.

In step S2607, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 26), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 26) instep S2607, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 26) in stepS2608, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2609, a flag (IsLastCuCoded)indicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 26) in stepS2609, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 26), thenext target CU is encoded/decoded.

In step S2608, when the coding block flag is the second value (No inFIG. 26), whether the IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2610, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 26), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 26) instep S2610, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2611, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2612, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2613, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

In step S2609, the flag IsLastCuCoded indicating whether the last CU inthe CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

FIG. 27 is a diagram illustrating a method of determining a quantizationparameter, using area information of a quantization group according to afurther embodiment of the present invention.

In step S2701, a flag cu_gp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 27), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 27), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,log4_diff_cu_qp_delta_area which is the area information of aquantization group may be entropy-coded/entropy-decoded in step S2702.

Accordingly, in step S2703, at least one of the area (QG_area) of thequantization group and the size of the quantization group may bedetermined on the basis of the area information of the quantizationgroup, i.e., at least one the of diff_cu_qp_delta_area and thelog4_diff_cu_qp_delta_area. FIG. 25 is a diagramlog4_diff_cu_qp_delta_area used as an example of the area information ofa quantization group, and FIG. 27 illustrates diff_cu_qp_delta_area asanother example of the area information.

In step S2704, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

In step S2705, when the area CU_area of the current block is equal to orlarger than the area of the quantization group, the IsCuDeltaQPCoded maybe set to the first value in step S2706.

In step S2705, when the area CU_area of the current block is smallerthan the area of the quantization group, the IsCuDeltaQPCoded may be setto the second value in step S2706.

In step S2707, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 27), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 27) instep S2707, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 27) in stepS2708, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2709, a flag IsLastCuCodedindicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 27) in stepS2709, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 27), thenext target CU is encoded/decoded.

In step S2708, when the coding block flag is the second value (No inFIG. 27), whether the IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2710, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 27), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 27) instep S2710, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2711, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2712, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2713, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

In step S2709, the flag IsLastCuCoded indicating whether the last CU inthe CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

FIG. 28 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toone embodiment of the present invention.

In step S2801, a flag cu_gp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 28), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 28), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,diff_cu_qp_delta_depth which is the depth information of a quantizationgroup may be entropy-coded/entropy-decoded in step S2802. Therefore, abasic unit on a basis of which signaling is performed duringencoding/decoding may be set on the basis of diff_cu_qp_delta_depthwhich is the depth information of a quantization group and the depth ofa block.

In step S2804, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

In step S2805, when the depth of the current block is less than or equalto the depth information of the quantization group, the IsCuDeltaQPCodedmay be set to the first value in step S2806.

In step S2807, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 28), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 28) instep S2807, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 28) in stepS2808, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2809, a flag IsLastCuCodedindicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 28) in stepS2809, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 28), thenext target CU is encoded/decoded.

In step S2808, when the coding block flag is the second value (No inFIG. 28), whether the IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2810, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 28), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 28) instep S2810, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2811, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2812, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2813, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

Next, in step S2809, the flag IsLastCuCoded indicating whether the lastCU in the CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

The depth of the current block may mean at least one of the depth of aquadtree and the depth of a multi-type tree, or the sum of the depths oftwo or more trees.

FIG. 29 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toanother embodiment of the present invention.

In step S2901, a flag cu_gp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 29), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 29), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,diff_cu_qp_delta_depth which is the depth information of a quantizationgroup may be entropy-coded/entropy-decoded in step S2902. Therefore, abasic unit on a basis of which signaling is performed duringencoding/decoding may be set according to diff_cu_qp_delta_depth whichis the depth information of a quantization group and according to ablock depth of a CTU/CU.

In step S2904, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

In step S2905, when the depth of the current block is less than or equalto the depth information of the quantization group, the IsCuDeltaQPCodedmay be set to the first value in step S2906.

In step S2905, when the depth of the current block is greater than thedepth of the quantization group, the IsCuDeltaQPCoded may be set to thesecond value in step S2906-1.

In step S2907, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 29), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 29) instep S2907, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When the coding block flag is the first value (Yes in FIG. 29) in stepS2908, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S2909, a flag IsLastCuCodedindicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 29) in stepS2909, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 29), thenext target CU is encoded/decoded.

In step S2908, when the coding block flag is the second value (No inFIG. 29), whether the IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S2910, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 29), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 29) instep S2910, the delta quantization parameter may beentropy-coded/entropy-decoded in step S2911, and then theIsCuDeltaQPCoded may be set to the second value.

In step S2912, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S2913, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

Next, in step S2909, the flag IsLastCuCoded indicating whether the lastCU in the CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

The depth of the current block may mean at least one of the depth of aquadtree and the depth of a multi-type tree, or the sum of the depths oftwo or more trees.

FIG. 30 is a diagram illustrating a method of determining a quantizationparameter, using depth information of a quantization group according toa further embodiment of the present invention.

In step S3001, a flag cu_gp_delta_enabled_flag may beentropy-coded/entropy-decoded. When the cu_qp_delta_enabled_flag is afirst value (Yes in FIG. 30), a delta quantization parameter may not beentropy-coded/entropy-decoded. On the other hand, when thecu_qp_delta_enabled_flag is a second value (No in FIG. 30), a deltaquantization parameter may be entropy-coded/entropy-decoded.

When the cu_qp_delta_enabled_flag is the second value,diff_cu_qp_delta_subdiv which is the subdivision information of aquantization group may be entropy-coded/entropy-decoded in step S3002.Therefore, a basic unit on a basis of which signaling is performedduring encoding/decoding may be set according to diff_cu_qp_delta_subdivwhich is the subdivision information of a quantization group and/oraccording to a subdivision value of a CTU/CU/block.

The cu_gp_delta_subdiv which is the subdivision information of thequantization group may be entropy-coded/entropy-decoded in a pictureparameter set (PPS). The cu_qp_delta_subdiv which is subdivisioninformation of the quantization group may be encoded/decoded into avariable length.

In step S3003, qgEnable is a variable indicating a condition under whicha delta quantization parameter can be transmitted. When a CTU isencoded/decoded, a cbSubdiv value, which is the subdivision value of thecurrent block, may be initialized to zero. When the qgEnable has a firstvalue, the delta quantization parameter may beentropy-coded/entropy-decoded. On the other hand, when the qgEnable hasa second value, the delta quantization parameter may not beentropy-coded/entropy-decoded.

In step S3004, encoding/decoding on a CTU may be performed. In thisstep, the CTU may be recursively partitioned into coding units (CUs) andthen encoded/decoded CU by CU. Here, the CU may mean at least one of aprediction unit (PU), a transform unit (TU), and a block. In this step,IsCuDeltaQPCoded may be set to a second value.

When the current qgEnable has the first value in step S3005 (Yes in FIG.30), the IsCuDeltaQPCoded may be set to the first value in step S3006.

When the current qgEnable has the second value in step S3005, theIsCuDeltaQPCoded may be set to the second value in step S3006-1.

In step S3007, when a CU_split_flag is entropy-coded/entropy-decodedinto the second value (Yes in FIG. 30), the CTU may be recursivelypartitioned into CUs. When the CU_split_flag isentropy-coded/entropy-decoded into the first value (No in FIG. 30) instep S3007, a coding block flag coded_block_flag may beentropy-coded/entropy-decoded.

When quadtree partitioning has been performed, the flag qt_split_cu_flagindicating whether the quadtree partitioning is performed may be set toa first value in step S3007-1. When the partitioning has not beenperformed, it may be set to a second value. When binary treepartitioning has been performed, the flag bt_split_cu_flag indicatingwhether the binary tree partitioning is performed may have a firstvalue. When the partitioning has not been performed, it may be set to asecond value. When a flag “qt_split_cu_flag” has a first value, thecbSubdiv is increased by two. When the flag “qt_split_cu_flag” has asecond value, the cbSubdiv is increased by one. When having the secondvalue, the cbSubdiv may not be increased.

When ternary tree partitioning has been performed, the flagtt_split_cu_flag indicating whether the ternary tree partitioning isperformed may be set to a first value in step S3007-2. When thepartitioning has not been performed, it may be set to a second value.When the flag “tt_split_cu_flag” has the first value, in a case wherethe current block is the middle block of a ternary tree, mid_tt_blockmay be set to a first value. In this case, the cbSubdiv may be increasedby one. When the current block is not the middle bock of a ternary tree,the cbSubdiv may be increased by two.

When the mid_tt_block indicating the middle block of a ternary tree hasa first value in step S3007-3, in a case where cbSubdiv+1 is less thanor equal to cu_qp_delta_subdiv, qgEnable may be set to a first value. Ina case where the cbSubdiv+1 is greater than the cu_qp_delta_subdiv, theqgEnable may be set to a second value. When the mid_tt_block has thesecond value, in a case where the cbSubdiv is less than or equal to thecu_qp_delta_subdiv, the qgEnable may be set to a first value. In a casewhere the cbSubdiv is greater than the cu_qp_delta_subdiv, the qgEnablemay be set to a second value.

When the coding block flag is the first value (Yes in FIG. 30) in stepS3008, the delta quantization parameter may not beentropy-coded/entropy-decoded. In step S3009, the flag IsLastCuCodedindicating whether or not the last CU in the CTU has beenencoded/decoded may be checked.

When the IsLastCuCoded is the second value (No in FIG. 30) in stepS3009, since the last CU has been encoded/decoded, theentropy-coding/entropy-decoding on the delta quantization parameterends. When the IsLastCuCoded is the first value (Yes in FIG. 30), thenext target CU is encoded/decoded.

In step S3008, when the coding block flag is the second value (No inFIG. 30), whether the IsCuDeltaQPCoded is set to the first value or thesecond value may be checked.

In step S3010, when the IsCuDeltaQPCoded is set to the second value (Noin FIG. 30), the flag IsLastCuCoded indicating whether or not the lastCU in the CTU has been encoded/decoded may be checked.

When the IsCuDeltaQPCoded is set to the first value (Yes in FIG. 30) instep S3010, the delta quantization parameter may beentropy-coded/entropy-decoded in step S3011, and then theIsCuDeltaQPCoded may be set to the second value.

In step S3012, a predicted quantization parameter may be determinedusing neighboring quantization groups.

In step S3013, the delta quantization parameter and the predictedquantization parameter may be added to determine the quantizationparameter.

Next, in step S3009, the flag IsLastCuCoded indicating whether the lastCU in the CTU has been encoded/decoded may be checked.

Here, the IsCuDeltaQPCoded may be set for each block or eachquantization group. At this time, it is possible to check whether thedelta quantization parameter is entropy-coded/entropy-decoded for eachblock or for each quantization group by using a flag such asIsCuDeltaQPCoded or a variable.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

FIGS. 31 and 32 are diagrams illustrating examples of syntax elementinformation required for entropy-coding/entropy-decoding of deltaquantization parameters according to one embodiment of the presentinvention.

A coding_quadtree( ) is a unit including at least one of syntax elementsused to encode/decode a quadtree block structure. In this case, x0 andy0 may be coordinate values representing the top left position of aCU/block. Here, log2CbSize may be a value obtained by calculating a log2function of the width or the height of a CU/block. Here, cqtDepth mayrepresent the depth of the current CU/block. Here, treeType mayrepresents the type of the tree of the current block.

Here, cqtDepth may represent the depth of the current CU/block. Here,cbSubdiv can represent a value obtained by multiplying the depth of thecurrent depth by two times. In the case of a quadtree, since each of thewidth and the height of a block is reduced to the half, the subdivisionvalue may be multiplied by two.

The subdivision information of the quantization group,cu_qp_delta_subdiv, may be compared with cuSubdiv to determine whetherto transmit the delta quantization parameter. When thecu_qp_delta_subdiv is greater than or equal to the cbSubdiv, a deltaquantization parameter value, CuQpDeltaVal, may be set to zero. When thecu_qp_delta_subdiv is smaller than the cbSubdiv, the CuQpDeltaVal maynot be set to zero.

The qtsplit_cu_flag indicates whether the next sub-block is partitionedby a quadtree split. When the qtsplit_cu_flag has a second value, thenext sub-block is partitioned by a quadtree split. When it has a firstvalue, the next sub-block is not partitioned by a quadtree split.

When the qt_split_cu_flag has the second value, the coding_quadtree( )may be 4 because a parent block is divided into four child blocks. Inthis case, it is possible to determine whether the block extends beyondthe border of the picture by comparing the width(pic_width_in_luma_samples) and the height (pic_height_in_luma_samples)of the picture with the x1 and the yl, respectively.

Here, multi_type_tree( ) is a unit including at least one of syntaxelements used to encode/decode a ternary tree block. In this case, thewidth and height of a CU, block, or tree can be obtained by1<<log2CbSize. Where, << represents a left shift operation.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

Here, multi_type_tree( ) is a unit including at least one of syntaxelements used to encode/decode a binary tree block or a ternary treeblock. In this case, x0 and y0 may be coordinate values representing thetop left position of a CU/block. In addition, cbWidth and cbHeight mayrepresent the width and the height of the current CU/block to beencoded/decoded. Here, cqtDepth may represent the depth of the currentCU/block. Here, mttDepth may represent the depth of a binary tree or aternary tree of the current CU/block. Here, the cbSubdiv may representthe subdivision value of the current CU/block, and the qgEnable may be aflag indicating whether or not to transmit the delta quantizationparameter. Here, partIdx may represent the index of the CU/block to becoded/decoded when the CU/Block is a binary tree or a ternary tree.Here, treeType may represent the type of the tree of the current block.

The subdivision information of the quantization group,cu_qp_delta_subdiv, may be compared with the cuSubdiv to determinewhether to transmit the delta quantization parameter when the qgEnablehas the second vale. When the qgEnable 2 has the second value and thecu_qp_delta_subdiv is greater than or equal to the cbSubdiv, a deltaquantization parameter value, CuQpDeltaVal, may be set to zero. When theqgEnable 1 has the first value and the cu_qp_delta_subdiv is less thanthe cbSubdiv, the CuQpDeltaVal may not be set to zero. When the qgEnablehas the second value, the CuQpDeltaVal may not be set to zero.

The mtt_split_cu_flag may be a flag indicating whether to divide a blockby a binary tree split or a ternary tree split. In this case, when themtt_split_cu_flag indicates SPLIT_BT_VER, it may mean a vertical binarytree split. Similarly, SPLIT_BT_HOR may mean a horizontal binary treesplit. In addition, when the mtt_split_cu_flag indicates SPLIT_TT_VER,it may mean a vertical ternary tree split. Similarly, when themtt_split_cu_flag indicates SPLIT_TT_HOR, it may mean a horizontalternary tree split.

When the current block is divided by binary tree partitioning, thecbSubdiv is increased by one. In addition, it is possible to determinewhether the block extends beyond the border of the picture by comparingthe width (pic_width_in_luma_samples) and the height(pic_height_in_luma_samples) of the picture with the x1 and the yl,respectively. In this case, FIG. 32 shows an example of vertical binarytree partitioning.

When ternary tree partitioning is performed, the flag value of theeqgEnable may be set. The subdivision information of the quantizationgroup, cu_qp_delta_subdiv, may be compared with the cuSubdiv+2 todetermine whether to transmit the delta quantization parameter. When theqgEnable has the second value and the cu_qp_delta_subdiv is greater thanor equal to the cbSubdiv+2, the value of the qgEnable may be set to thesecond value. When the qgEnable 1 has the first value and thecu_qp_delta_subdiv is less than the cbSubdiv, the value of the qgEnablemay be set to the first value. In this case, the set qgEnable value maybe stored in the multi_type_tree( ) of a block that is partitioned byternary tree partitioning. FIG. 32 shows an example of vertical ternarytree partitioning.

In the case of a ternary tree block, the subdivision value (cbSubdiv) ofeach of the left block and the right block may be increased by one, andthe subdivision value (cbSubdiv) of the middle block may be increased bytwo.

Here, coding_unit( ) represents a unit of syntax elements used toencode/decode at least one piece of information on a CU/block.

In the embodiment described above, the first value may be 0 and thesecond value may be 1. Conversely, the first value may be 1 and thesecond value may be 0.

At least one of syntax elements, information, flags, and indexesentropy-coded in the encoder and entropy-decoded in the decoder may beencoded or decoded through at least one of binarization, debinarization,and entropy-coding/entropy-decoding. Here, for thebinarization/debinarization and the entropy-coding/entropy-decoding, atleast one of the following techniques may be used which include a signed0-th order Exp_Golomb binarization/debinarization method (se(v)), asigned k-th order Exp_Golomb binarization/debinarization method(sek(v)), a 0-th order Exp_Golomb for positive integers with no sign(ue(v)), a k-th order Exp_Golomb binarization/debinarization method forpositive integers with no sign (uek(v)), a fixed-lengthbinarization/debinarization method (f(n)), a truncated Ricebinarization/debinarization method or a truncated unarybinarization/debinarization method (tu(v)), a truncated binarybinarization/debinarization method (tb(v)), a context-adaptivearithmetic coding/decoding method (ae(v)), a byte-based bits string(b(8)), a binarization/debinarization method for integers with sign(i(n)), a binarization/debinarization method for positive integers withno sign (u(n)), and unary binarization/debinarization method.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus using quantization parameters.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus adaptively determining a suitablesize of a block for which a delta quantization parameter is to besignaled, according to a block structure and according to sizeinformation of a quantization group encoded/decoded on a high-level, toimprove signaling and coding efficiency of quantization parameters.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus that determine a quantizationparameter for a current block using a quantization parameter of aneighboring quantization group, to reduce the number of bits requiredfor encoding/decoding of a delta quantization parameter.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus capable of efficiently signalingdelta quantization parameters for various blocks having different treestructures such as a binary tree and a ternary tree.

According to the present invention, it is possible to provide an imageencoding/decoding method and apparatus capable of efficiently performingrate control on various blocks having different tree structures such asa binary tree and a ternary tree.

According to the present invention, it is possible to provide arecording medium storing a bitstream generated by the encoding/decodingmethod or apparatus according to the present invention.

The above embodiments may be performed in the same method in an encoderand a decoder.

At least one or a combination of the above embodiments may be used toencode/decode a video.

A sequence of applying to above embodiment may be different between anencoder and a decoder, or the sequence applying to above embodiment maybe the same in the encoder and the decoder.

The above embodiment may be performed on each luma signal and chromasignal, or the above embodiment may be identically performed on luma andchroma signals.

A block form to which the above embodiments of the present invention areapplied may have a square form or a non-square form.

The above embodiment of the present invention may be applied dependingon a size of at least one of a coding block, a prediction block, atransform block, a block, a current block, a coding unit, a predictionunit, a transform unit, a unit, and a current unit. Herein, the size maybe defined as a minimum size or maximum size or both so that the aboveembodiments are applied, or may be defined as a fixed size to which theabove embodiment is applied. In addition, in the above embodiments, afirst embodiment may be applied to a first size, and a second embodimentmay be applied to a second size. In other words, the above embodimentsmay be applied in combination depending on a size. In addition, theabove embodiments may be applied when a size is equal to or greater thata minimum size and equal to or smaller than a maximum size. In otherwords, the above embodiments may be applied when a block size isincluded within a certain range.

For example, the above embodiments may be applied when a size of currentblock is 8×8 or greater. For example, the above embodiments may beapplied when a size of current block is 4×4 or greater. For example, theabove embodiments may be applied when a size of current block is 16×16or greater. For example, the above embodiments may be applied when asize of current block is equal to or greater than 16×16 and equal to orsmaller than 64×64.

The above embodiments of the present invention may be applied dependingon a temporal layer. In order to identify a temporal layer to which theabove embodiments may be applied, a corresponding identifier may besignaled, and the above embodiments may be applied to a specifiedtemporal layer identified by the corresponding identifier. Herein, theidentifier may be defined as the lowest layer or the highest layer orboth to which the above embodiment may be applied, or may be defined toindicate a specific layer to which the embodiment is applied. Inaddition, a fixed temporal layer to which the embodiment is applied maybe defined.

For example, the above embodiments may be applied when a temporal layerof a current image is the lowest layer. For example, the aboveembodiments may be applied when a temporal layer identifier of a currentimage is 1. For example, the above embodiments may be applied when atemporal layer of a current image is the highest layer.

A slice type or a tile group type to which the above embodiments of thepresent invention are applied may be defined, and the above embodimentsmay be applied depending on the corresponding slice type or tile grouptype.

In the above-described embodiments, the methods are described based onthe flowcharts with a series of steps or units, but the presentinvention is not limited to the order of the steps, and rather, somesteps may be performed simultaneously or in different order with othersteps. In addition, it should be appreciated by one of ordinary skill inthe art that the steps in the flowcharts do not exclude each other andthat other steps may be added to the flowcharts or some of the steps maybe deleted from the flowcharts without influencing the scope of thepresent invention.

The embodiments include various aspects of examples. All possiblecombinations for various aspects may not be described, but those skilledin the art will be able to recognize different combinations.Accordingly, the present invention may include all replacements,modifications, and changes within the scope of the claims.

The embodiments of the present invention may be implemented in a form ofprogram instructions, which are executable by various computercomponents, and recorded in a computer-readable recording medium. Thecomputer-readable recording medium may include stand-alone or acombination of program instructions, data files, data structures, etc.The program instructions recorded in the computer-readable recordingmedium may be specially designed and constructed for the presentinvention, or well-known to a person of ordinary skilled in computersoftware technology field. Examples of the computer-readable recordingmedium include magnetic recording media such as hard disks, floppydisks, and magnetic tapes; optical data storage media such as CD-ROMs orDVD-ROMs; magneto-optimum media such as floptical disks; and hardwaredevices, such as read-only memory (ROM), random-access memory (RAM),flash memory, etc., which are particularly structured to store andimplement the program instruction. Examples of the program instructionsinclude not only a mechanical language code formatted by a compiler butalso a high level language code that may be implemented by a computerusing an interpreter. The hardware devices may be configured to beoperated by one or more software modules or vice versa to conduct theprocesses according to the present invention.

Although the present invention has been described in terms of specificitems such as detailed elements as well as the limited embodiments andthe drawings, they are only provided to help more general understandingof the invention, and the present invention is not limited to the aboveembodiments. It will be appreciated by those skilled in the art to whichthe present invention pertains that various modifications and changesmay be made from the above description.

Therefore, the spirit of the present invention shall not be limited tothe above-described embodiments, and the entire scope of the appendedclaims and their equivalents will fall within the scope and spirit ofthe invention.

INDUSTRIAL APPLICABILITY

The present invention may be used to encode or decode an image.

1. An image decoding method comprising: decoding subdivision informationof quantization group from a bitstream, the subdivision informationindicating a maximum subdivision value of the quantization group; inresponse to a subdivision value of a current block being equal to orsmaller than the maximum subdivision value of the quantization group,setting quantization parameter coding information to a first value, thequantization parameter coding information indicating whether aquantization parameter is coded; and in response to the quantizationparameter coding information being set to the first value, determining adelta quantization parameter of the current block, deriving aquantization parameter of the current block based on the deltaquantization parameter, and setting the quantization parameter codinginformation to a second value, wherein the subdivision value is a ratioof areas between the current block and a coding tree block, and whereinthe delta quantization parameter is determined based on absolute valueinformation of the delta quantization parameter and sign information ofthe delta quantization parameter.
 2. An image encoding methodcomprising: determining a maximum subdivision value of quantizationgroup; determining a quantization parameter of a current block; inresponse to a subdivision value of the current block being equal to orsmaller than the maximum subdivision value of the quantization group,setting quantization parameter coding information to a first value, thequantization parameter coding information indicating whether aquantization parameter is coded; in response to the quantizationparameter coding information indicating the first value, encoding adelta quantization parameter of the current block and setting thequantization parameter coding information to a second value; andencoding subdivision information of the quantization group indicatingthe maximum subdivision value of the quantization group, wherein thesubdivision value is a ratio of areas between the current block and acoding tree block, and wherein the delta quantization parameter isencoded by encoding absolute value information of the delta quantizationparameter and sign information of the delta quantization parameter.
 3. Acomputer-readable non-transitory recording medium storing a bitstreamthat is decoded by an image decoding method, wherein the bitstreamcontains subdivision information of quantization group indicating amaximum subdivision value of the quantization group and a deltaquantization parameter of a current block, and wherein the imagedecoding method comprises: in response to a subdivision value of thecurrent block being equal to or smaller than the maximum subdivisionvalue of the quantization group, setting quantization parameter codinginformation to a first value, the quantization parameter codinginformation indicating whether a quantization parameter is coded; inresponse to the quantization parameter coding information indicating thefirst value, determining the delta quantization parameter of the currentblock, deriving a quantization parameter of the current block based onthe delta quantization parameter, and setting the quantization parametercoding information to a second value, wherein the subdivision value is aratio of areas between the current block and a coding tree block, andwherein the delta quantization parameter is determined based on absolutevalue information of the delta quantization parameter and signinformation of the delta quantization parameter.